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/array-examples/standard_running_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:55:24,343 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:55:24,345 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:55:24,361 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:55:24,361 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:55:24,362 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:55:24,363 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:55:24,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:55:24,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:55:24,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:55:24,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:55:24,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:55:24,377 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:55:24,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:55:24,387 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:55:24,388 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:55:24,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:55:24,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:55:24,393 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:55:24,394 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:55:24,395 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:55:24,397 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:55:24,399 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:55:24,399 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:55:24,400 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:55:24,401 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:55:24,402 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:55:24,402 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:55:24,403 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:55:24,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:55:24,405 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:55:24,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:55:24,405 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:55:24,406 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:55:24,407 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:55:24,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:55:24,408 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 11:55:24,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:55:24,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:55:24,426 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:55:24,426 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:55:24,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:55:24,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:55:24,428 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:55:24,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:55:24,428 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:55:24,428 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:55:24,428 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:55:24,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:55:24,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:55:24,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:55:24,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:55:24,430 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:55:24,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:55:24,431 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:55:24,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:55:24,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:55:24,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:55:24,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:55:24,433 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:55:24,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:24,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:55:24,434 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:55:24,434 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:55:24,434 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:55:24,434 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:55:24,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:55:24,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:55:24,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:55:24,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:55:24,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:55:24,528 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:55:24,529 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:55:24,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_running_false-unreach-call.i [2018-11-23 11:55:24,593 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de793037/a3bb9132842046be93d782312537e887/FLAG8747664dd [2018-11-23 11:55:25,058 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:55:25,058 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_running_false-unreach-call.i [2018-11-23 11:55:25,066 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de793037/a3bb9132842046be93d782312537e887/FLAG8747664dd [2018-11-23 11:55:25,398 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de793037/a3bb9132842046be93d782312537e887 [2018-11-23 11:55:25,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:55:25,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:55:25,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:25,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:55:25,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:55:25,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@168ce948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25, skipping insertion in model container [2018-11-23 11:55:25,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:55:25,457 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:55:25,678 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:25,685 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:55:25,713 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:25,745 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:55:25,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25 WrapperNode [2018-11-23 11:55:25,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:25,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:25,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:55:25,748 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:55:25,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:25,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:55:25,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:55:25,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:55:25,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:55:25,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:55:25,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:55:25,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:55:25,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (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 11:55:26,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:55:26,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:55:26,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:55:26,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:55:26,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:55:26,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:55:26,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:55:26,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:55:26,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:55:26,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:55:26,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:55:26,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:55:26,651 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:55:26,651 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:55:26,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:26 BoogieIcfgContainer [2018-11-23 11:55:26,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:55:26,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:55:26,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:55:26,657 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:55:26,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:55:25" (1/3) ... [2018-11-23 11:55:26,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1f5fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:26, skipping insertion in model container [2018-11-23 11:55:26,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (2/3) ... [2018-11-23 11:55:26,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1f5fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:26, skipping insertion in model container [2018-11-23 11:55:26,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:26" (3/3) ... [2018-11-23 11:55:26,661 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_running_false-unreach-call.i [2018-11-23 11:55:26,672 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:55:26,680 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:55:26,699 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:55:26,733 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:55:26,734 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:55:26,734 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:55:26,735 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:55:26,735 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:55:26,735 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:55:26,735 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:55:26,736 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:55:26,736 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:55:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 11:55:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:55:26,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:26,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:26,766 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:26,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:26,771 INFO L82 PathProgramCache]: Analyzing trace with hash -815618533, now seen corresponding path program 1 times [2018-11-23 11:55:26,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:26,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:26,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:26,921 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 11:55:26,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-23 11:55:26,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 11:55:26,926 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #79#return; {32#true} is VALID [2018-11-23 11:55:26,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2018-11-23 11:55:26,926 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {32#true} is VALID [2018-11-23 11:55:26,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 11:55:26,928 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~f~0 := 1;~i~0 := 0; {33#false} is VALID [2018-11-23 11:55:26,928 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 11:55:26,929 INFO L256 TraceCheckUtils]: 9: Hoare triple {33#false} call __VERIFIER_assert(~f~0); {33#false} is VALID [2018-11-23 11:55:26,929 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 11:55:26,929 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 11:55:26,930 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 11:55:26,933 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 11:55:26,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:26,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:55:26,942 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:55:26,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:26,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:55:27,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:27,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:55:27,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:55:27,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:55:27,086 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 11:55:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:27,409 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2018-11-23 11:55:27,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:55:27,410 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:55:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 11:55:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 11:55:27,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 65 transitions. [2018-11-23 11:55:27,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:27,611 INFO L225 Difference]: With dead ends: 49 [2018-11-23 11:55:27,611 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:55:27,614 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 11:55:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:55:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 11:55:27,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:27,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 11:55:27,653 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:55:27,653 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:55:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:27,658 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2018-11-23 11:55:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-11-23 11:55:27,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:27,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:27,659 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:55:27,659 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:55:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:27,663 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2018-11-23 11:55:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-11-23 11:55:27,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:27,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:27,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:27,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:55:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-23 11:55:27,670 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2018-11-23 11:55:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:27,670 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-23 11:55:27,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:55:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-11-23 11:55:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:55:27,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:27,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:27,672 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:27,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:27,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1988224432, now seen corresponding path program 1 times [2018-11-23 11:55:27,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:27,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:27,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,854 INFO L256 TraceCheckUtils]: 0: Hoare triple {170#true} call ULTIMATE.init(); {170#true} is VALID [2018-11-23 11:55:27,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {170#true} is VALID [2018-11-23 11:55:27,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {170#true} assume true; {170#true} is VALID [2018-11-23 11:55:27,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {170#true} {170#true} #79#return; {170#true} is VALID [2018-11-23 11:55:27,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {170#true} call #t~ret7 := main(); {170#true} is VALID [2018-11-23 11:55:27,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {172#(= main_~i~0 0)} is VALID [2018-11-23 11:55:27,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {172#(= main_~i~0 0)} assume !(~i~0 < 100000); {171#false} is VALID [2018-11-23 11:55:27,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {171#false} ~f~0 := 1;~i~0 := 0; {171#false} is VALID [2018-11-23 11:55:27,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {171#false} assume !(~i~0 < 100000); {171#false} is VALID [2018-11-23 11:55:27,865 INFO L256 TraceCheckUtils]: 9: Hoare triple {171#false} call __VERIFIER_assert(~f~0); {171#false} is VALID [2018-11-23 11:55:27,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {171#false} ~cond := #in~cond; {171#false} is VALID [2018-11-23 11:55:27,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {171#false} assume 0 == ~cond; {171#false} is VALID [2018-11-23 11:55:27,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {171#false} assume !false; {171#false} is VALID [2018-11-23 11:55:27,867 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 11:55:27,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:27,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:27,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:55:27,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:27,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:55:27,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:27,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:27,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:27,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:27,913 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 3 states. [2018-11-23 11:55:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,204 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-11-23 11:55:28,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:28,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:55:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:55:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 11:55:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:55:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 11:55:28,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-23 11:55:28,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:28,691 INFO L225 Difference]: With dead ends: 45 [2018-11-23 11:55:28,691 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:55:28,693 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 11:55:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:55:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-23 11:55:28,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:28,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 24 states. [2018-11-23 11:55:28,725 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 24 states. [2018-11-23 11:55:28,725 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 24 states. [2018-11-23 11:55:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,729 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2018-11-23 11:55:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2018-11-23 11:55:28,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,730 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 32 states. [2018-11-23 11:55:28,730 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 32 states. [2018-11-23 11:55:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,734 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2018-11-23 11:55:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2018-11-23 11:55:28,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:28,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:55:28,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-23 11:55:28,738 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2018-11-23 11:55:28,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:28,738 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-23 11:55:28,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:28,738 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-11-23 11:55:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:55:28,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:28,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:28,740 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:28,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:28,740 INFO L82 PathProgramCache]: Analyzing trace with hash -283448979, now seen corresponding path program 1 times [2018-11-23 11:55:28,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:28,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:28,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:28,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:28,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {331#true} call ULTIMATE.init(); {331#true} is VALID [2018-11-23 11:55:28,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {331#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {331#true} is VALID [2018-11-23 11:55:28,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2018-11-23 11:55:28,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #79#return; {331#true} is VALID [2018-11-23 11:55:28,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {331#true} call #t~ret7 := main(); {331#true} is VALID [2018-11-23 11:55:28,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {331#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {331#true} is VALID [2018-11-23 11:55:28,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {331#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {331#true} is VALID [2018-11-23 11:55:28,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {331#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {331#true} is VALID [2018-11-23 11:55:28,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {331#true} ~i~0 := 1 + ~i~0; {331#true} is VALID [2018-11-23 11:55:28,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {331#true} assume !(~i~0 < 100000); {331#true} is VALID [2018-11-23 11:55:28,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {331#true} ~f~0 := 1;~i~0 := 0; {331#true} is VALID [2018-11-23 11:55:28,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {331#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {333#(or (<= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (not |main_#t~short3|))} is VALID [2018-11-23 11:55:28,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {333#(or (<= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (not |main_#t~short3|))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {334#(<= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-23 11:55:28,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {334#(<= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {334#(<= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-23 11:55:28,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {334#(<= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {335#(not |main_#t~short6|)} is VALID [2018-11-23 11:55:28,955 INFO L273 TraceCheckUtils]: 15: Hoare triple {335#(not |main_#t~short6|)} assume #t~short6;call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short6 := 0 == #t~mem5; {332#false} is VALID [2018-11-23 11:55:28,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {332#false} assume #t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5;~f~0 := 0; {332#false} is VALID [2018-11-23 11:55:28,956 INFO L273 TraceCheckUtils]: 17: Hoare triple {332#false} ~i~0 := 1 + ~i~0; {332#false} is VALID [2018-11-23 11:55:28,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {332#false} assume !(~i~0 < 100000); {332#false} is VALID [2018-11-23 11:55:28,956 INFO L256 TraceCheckUtils]: 19: Hoare triple {332#false} call __VERIFIER_assert(~f~0); {332#false} is VALID [2018-11-23 11:55:28,956 INFO L273 TraceCheckUtils]: 20: Hoare triple {332#false} ~cond := #in~cond; {332#false} is VALID [2018-11-23 11:55:28,956 INFO L273 TraceCheckUtils]: 21: Hoare triple {332#false} assume 0 == ~cond; {332#false} is VALID [2018-11-23 11:55:28,957 INFO L273 TraceCheckUtils]: 22: Hoare triple {332#false} assume !false; {332#false} is VALID [2018-11-23 11:55:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:55:28,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:28,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:55:28,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 11:55:28,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:28,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:55:29,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:29,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:55:29,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:55:29,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:29,017 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 5 states. [2018-11-23 11:55:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,298 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2018-11-23 11:55:29,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:55:29,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 11:55:29,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-23 11:55:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-23 11:55:29,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2018-11-23 11:55:29,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:29,443 INFO L225 Difference]: With dead ends: 42 [2018-11-23 11:55:29,443 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 11:55:29,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 11:55:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-23 11:55:29,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:29,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2018-11-23 11:55:29,483 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2018-11-23 11:55:29,483 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2018-11-23 11:55:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,486 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 11:55:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 11:55:29,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,488 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2018-11-23 11:55:29,488 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2018-11-23 11:55:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,491 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 11:55:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 11:55:29,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:29,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:29,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:55:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-11-23 11:55:29,497 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2018-11-23 11:55:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:29,498 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-23 11:55:29,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:55:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-11-23 11:55:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:55:29,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:29,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:29,501 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:29,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:29,501 INFO L82 PathProgramCache]: Analyzing trace with hash 682211757, now seen corresponding path program 1 times [2018-11-23 11:55:29,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:29,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2018-11-23 11:55:29,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {493#true} is VALID [2018-11-23 11:55:29,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2018-11-23 11:55:29,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #79#return; {493#true} is VALID [2018-11-23 11:55:29,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret7 := main(); {493#true} is VALID [2018-11-23 11:55:29,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {493#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {495#(= main_~i~0 0)} is VALID [2018-11-23 11:55:29,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {495#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {495#(= main_~i~0 0)} is VALID [2018-11-23 11:55:29,628 INFO L273 TraceCheckUtils]: 7: Hoare triple {495#(= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {495#(= main_~i~0 0)} is VALID [2018-11-23 11:55:29,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {495#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {496#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:29,629 INFO L273 TraceCheckUtils]: 9: Hoare triple {496#(<= main_~i~0 1)} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:29,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#false} ~f~0 := 1;~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:29,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {494#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {494#false} is VALID [2018-11-23 11:55:29,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {494#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {494#false} is VALID [2018-11-23 11:55:29,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {494#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {494#false} is VALID [2018-11-23 11:55:29,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {494#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {494#false} is VALID [2018-11-23 11:55:29,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {494#false} assume !#t~short6; {494#false} is VALID [2018-11-23 11:55:29,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {494#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {494#false} is VALID [2018-11-23 11:55:29,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {494#false} ~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:29,632 INFO L273 TraceCheckUtils]: 18: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:29,632 INFO L256 TraceCheckUtils]: 19: Hoare triple {494#false} call __VERIFIER_assert(~f~0); {494#false} is VALID [2018-11-23 11:55:29,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {494#false} ~cond := #in~cond; {494#false} is VALID [2018-11-23 11:55:29,633 INFO L273 TraceCheckUtils]: 21: Hoare triple {494#false} assume 0 == ~cond; {494#false} is VALID [2018-11-23 11:55:29,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {494#false} assume !false; {494#false} is VALID [2018-11-23 11:55:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:55:29,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:29,635 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 11:55:29,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:29,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2018-11-23 11:55:29,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {493#true} is VALID [2018-11-23 11:55:29,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2018-11-23 11:55:29,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #79#return; {493#true} is VALID [2018-11-23 11:55:29,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret7 := main(); {493#true} is VALID [2018-11-23 11:55:30,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {493#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {515#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:30,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {515#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {515#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:30,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {515#(<= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {515#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:30,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {515#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {496#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {496#(<= main_~i~0 1)} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:30,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#false} ~f~0 := 1;~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:30,005 INFO L273 TraceCheckUtils]: 11: Hoare triple {494#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {494#false} is VALID [2018-11-23 11:55:30,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {494#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {494#false} is VALID [2018-11-23 11:55:30,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {494#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {494#false} is VALID [2018-11-23 11:55:30,006 INFO L273 TraceCheckUtils]: 14: Hoare triple {494#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {494#false} is VALID [2018-11-23 11:55:30,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {494#false} assume !#t~short6; {494#false} is VALID [2018-11-23 11:55:30,007 INFO L273 TraceCheckUtils]: 16: Hoare triple {494#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {494#false} is VALID [2018-11-23 11:55:30,007 INFO L273 TraceCheckUtils]: 17: Hoare triple {494#false} ~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:30,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:30,008 INFO L256 TraceCheckUtils]: 19: Hoare triple {494#false} call __VERIFIER_assert(~f~0); {494#false} is VALID [2018-11-23 11:55:30,008 INFO L273 TraceCheckUtils]: 20: Hoare triple {494#false} ~cond := #in~cond; {494#false} is VALID [2018-11-23 11:55:30,008 INFO L273 TraceCheckUtils]: 21: Hoare triple {494#false} assume 0 == ~cond; {494#false} is VALID [2018-11-23 11:55:30,009 INFO L273 TraceCheckUtils]: 22: Hoare triple {494#false} assume !false; {494#false} is VALID [2018-11-23 11:55:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:55:30,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:30,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:55:30,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 11:55:30,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:30,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:55:30,092 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 11:55:30,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:55:30,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:55:30,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:30,093 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 5 states. [2018-11-23 11:55:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,403 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2018-11-23 11:55:30,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:30,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 11:55:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 11:55:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 11:55:30,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2018-11-23 11:55:30,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:30,618 INFO L225 Difference]: With dead ends: 72 [2018-11-23 11:55:30,618 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:55:30,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:55:30,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2018-11-23 11:55:30,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:30,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 42 states. [2018-11-23 11:55:30,640 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 42 states. [2018-11-23 11:55:30,640 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 42 states. [2018-11-23 11:55:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,643 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2018-11-23 11:55:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2018-11-23 11:55:30,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:30,645 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 54 states. [2018-11-23 11:55:30,645 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 54 states. [2018-11-23 11:55:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,649 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2018-11-23 11:55:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2018-11-23 11:55:30,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:30,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:30,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:55:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2018-11-23 11:55:30,653 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 23 [2018-11-23 11:55:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:30,654 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2018-11-23 11:55:30,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:55:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2018-11-23 11:55:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:55:30,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:30,655 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:30,656 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:30,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash -678688720, now seen corresponding path program 2 times [2018-11-23 11:55:30,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:30,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:30,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:30,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2018-11-23 11:55:30,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {816#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {816#true} is VALID [2018-11-23 11:55:30,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-23 11:55:30,799 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #79#return; {816#true} is VALID [2018-11-23 11:55:30,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret7 := main(); {816#true} is VALID [2018-11-23 11:55:30,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {816#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {818#(= main_~i~0 0)} is VALID [2018-11-23 11:55:30,804 INFO L273 TraceCheckUtils]: 6: Hoare triple {818#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {818#(= main_~i~0 0)} is VALID [2018-11-23 11:55:30,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {818#(= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {818#(= main_~i~0 0)} is VALID [2018-11-23 11:55:30,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {818#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {819#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {819#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {819#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {819#(<= main_~i~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {819#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {819#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {820#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {820#(<= main_~i~0 2)} assume !(~i~0 < 100000); {817#false} is VALID [2018-11-23 11:55:30,835 INFO L273 TraceCheckUtils]: 13: Hoare triple {817#false} ~f~0 := 1;~i~0 := 0; {817#false} is VALID [2018-11-23 11:55:30,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {817#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {817#false} is VALID [2018-11-23 11:55:30,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {817#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {817#false} is VALID [2018-11-23 11:55:30,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {817#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {817#false} is VALID [2018-11-23 11:55:30,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {817#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {817#false} is VALID [2018-11-23 11:55:30,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {817#false} assume !#t~short6; {817#false} is VALID [2018-11-23 11:55:30,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {817#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {817#false} is VALID [2018-11-23 11:55:30,837 INFO L273 TraceCheckUtils]: 20: Hoare triple {817#false} ~i~0 := 1 + ~i~0; {817#false} is VALID [2018-11-23 11:55:30,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {817#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {817#false} is VALID [2018-11-23 11:55:30,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {817#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {817#false} is VALID [2018-11-23 11:55:30,838 INFO L273 TraceCheckUtils]: 23: Hoare triple {817#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {817#false} is VALID [2018-11-23 11:55:30,839 INFO L273 TraceCheckUtils]: 24: Hoare triple {817#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {817#false} is VALID [2018-11-23 11:55:30,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {817#false} assume !#t~short6; {817#false} is VALID [2018-11-23 11:55:30,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {817#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {817#false} is VALID [2018-11-23 11:55:30,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {817#false} ~i~0 := 1 + ~i~0; {817#false} is VALID [2018-11-23 11:55:30,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {817#false} assume !(~i~0 < 100000); {817#false} is VALID [2018-11-23 11:55:30,840 INFO L256 TraceCheckUtils]: 29: Hoare triple {817#false} call __VERIFIER_assert(~f~0); {817#false} is VALID [2018-11-23 11:55:30,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {817#false} ~cond := #in~cond; {817#false} is VALID [2018-11-23 11:55:30,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {817#false} assume 0 == ~cond; {817#false} is VALID [2018-11-23 11:55:30,841 INFO L273 TraceCheckUtils]: 32: Hoare triple {817#false} assume !false; {817#false} is VALID [2018-11-23 11:55:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:55:30,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:30,844 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 11:55:30,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:30,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:30,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:30,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:30,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2018-11-23 11:55:30,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {816#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {816#true} is VALID [2018-11-23 11:55:30,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-23 11:55:30,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #79#return; {816#true} is VALID [2018-11-23 11:55:30,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret7 := main(); {816#true} is VALID [2018-11-23 11:55:30,994 INFO L273 TraceCheckUtils]: 5: Hoare triple {816#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {839#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:30,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {839#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {839#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:30,995 INFO L273 TraceCheckUtils]: 7: Hoare triple {839#(<= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {839#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:31,001 INFO L273 TraceCheckUtils]: 8: Hoare triple {839#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {819#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {819#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {819#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {819#(<= main_~i~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {819#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,005 INFO L273 TraceCheckUtils]: 11: Hoare triple {819#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {820#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:31,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {820#(<= main_~i~0 2)} assume !(~i~0 < 100000); {817#false} is VALID [2018-11-23 11:55:31,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {817#false} ~f~0 := 1;~i~0 := 0; {817#false} is VALID [2018-11-23 11:55:31,006 INFO L273 TraceCheckUtils]: 14: Hoare triple {817#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {817#false} is VALID [2018-11-23 11:55:31,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {817#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {817#false} is VALID [2018-11-23 11:55:31,007 INFO L273 TraceCheckUtils]: 16: Hoare triple {817#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {817#false} is VALID [2018-11-23 11:55:31,007 INFO L273 TraceCheckUtils]: 17: Hoare triple {817#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {817#false} is VALID [2018-11-23 11:55:31,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {817#false} assume !#t~short6; {817#false} is VALID [2018-11-23 11:55:31,008 INFO L273 TraceCheckUtils]: 19: Hoare triple {817#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {817#false} is VALID [2018-11-23 11:55:31,008 INFO L273 TraceCheckUtils]: 20: Hoare triple {817#false} ~i~0 := 1 + ~i~0; {817#false} is VALID [2018-11-23 11:55:31,009 INFO L273 TraceCheckUtils]: 21: Hoare triple {817#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {817#false} is VALID [2018-11-23 11:55:31,009 INFO L273 TraceCheckUtils]: 22: Hoare triple {817#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {817#false} is VALID [2018-11-23 11:55:31,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {817#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {817#false} is VALID [2018-11-23 11:55:31,009 INFO L273 TraceCheckUtils]: 24: Hoare triple {817#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {817#false} is VALID [2018-11-23 11:55:31,010 INFO L273 TraceCheckUtils]: 25: Hoare triple {817#false} assume !#t~short6; {817#false} is VALID [2018-11-23 11:55:31,010 INFO L273 TraceCheckUtils]: 26: Hoare triple {817#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {817#false} is VALID [2018-11-23 11:55:31,010 INFO L273 TraceCheckUtils]: 27: Hoare triple {817#false} ~i~0 := 1 + ~i~0; {817#false} is VALID [2018-11-23 11:55:31,011 INFO L273 TraceCheckUtils]: 28: Hoare triple {817#false} assume !(~i~0 < 100000); {817#false} is VALID [2018-11-23 11:55:31,011 INFO L256 TraceCheckUtils]: 29: Hoare triple {817#false} call __VERIFIER_assert(~f~0); {817#false} is VALID [2018-11-23 11:55:31,011 INFO L273 TraceCheckUtils]: 30: Hoare triple {817#false} ~cond := #in~cond; {817#false} is VALID [2018-11-23 11:55:31,011 INFO L273 TraceCheckUtils]: 31: Hoare triple {817#false} assume 0 == ~cond; {817#false} is VALID [2018-11-23 11:55:31,012 INFO L273 TraceCheckUtils]: 32: Hoare triple {817#false} assume !false; {817#false} is VALID [2018-11-23 11:55:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:55:31,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:31,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:55:31,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 11:55:31,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:31,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:55:31,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:31,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:55:31,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:55:31,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:31,078 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 6 states. [2018-11-23 11:55:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,411 INFO L93 Difference]: Finished difference Result 97 states and 134 transitions. [2018-11-23 11:55:31,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:55:31,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 11:55:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 11:55:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 11:55:31,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 92 transitions. [2018-11-23 11:55:31,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:31,608 INFO L225 Difference]: With dead ends: 97 [2018-11-23 11:55:31,608 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 11:55:31,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 11:55:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2018-11-23 11:55:31,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:31,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 56 states. [2018-11-23 11:55:31,648 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 56 states. [2018-11-23 11:55:31,648 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 56 states. [2018-11-23 11:55:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,652 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2018-11-23 11:55:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2018-11-23 11:55:31,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:31,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:31,653 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 68 states. [2018-11-23 11:55:31,653 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 68 states. [2018-11-23 11:55:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,657 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2018-11-23 11:55:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2018-11-23 11:55:31,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:31,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:31,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:31,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:55:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2018-11-23 11:55:31,662 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 33 [2018-11-23 11:55:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:31,662 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2018-11-23 11:55:31,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:55:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2018-11-23 11:55:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:55:31,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:31,664 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:31,665 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:31,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1703596237, now seen corresponding path program 3 times [2018-11-23 11:55:31,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:31,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:31,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:31,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:31,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {1242#true} call ULTIMATE.init(); {1242#true} is VALID [2018-11-23 11:55:31,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {1242#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1242#true} is VALID [2018-11-23 11:55:31,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {1242#true} assume true; {1242#true} is VALID [2018-11-23 11:55:31,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1242#true} {1242#true} #79#return; {1242#true} is VALID [2018-11-23 11:55:31,813 INFO L256 TraceCheckUtils]: 4: Hoare triple {1242#true} call #t~ret7 := main(); {1242#true} is VALID [2018-11-23 11:55:31,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {1242#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1244#(= main_~i~0 0)} is VALID [2018-11-23 11:55:31,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {1244#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1244#(= main_~i~0 0)} is VALID [2018-11-23 11:55:31,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {1244#(= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1244#(= main_~i~0 0)} is VALID [2018-11-23 11:55:31,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {1244#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1245#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {1245#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1245#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {1245#(<= main_~i~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1245#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {1245#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1246#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:31,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {1246#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1246#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:31,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {1246#(<= main_~i~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1246#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:31,823 INFO L273 TraceCheckUtils]: 14: Hoare triple {1246#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1247#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:31,824 INFO L273 TraceCheckUtils]: 15: Hoare triple {1247#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1243#false} is VALID [2018-11-23 11:55:31,824 INFO L273 TraceCheckUtils]: 16: Hoare triple {1243#false} ~f~0 := 1;~i~0 := 0; {1243#false} is VALID [2018-11-23 11:55:31,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {1243#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {1243#false} is VALID [2018-11-23 11:55:31,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {1243#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {1243#false} is VALID [2018-11-23 11:55:31,825 INFO L273 TraceCheckUtils]: 19: Hoare triple {1243#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {1243#false} is VALID [2018-11-23 11:55:31,826 INFO L273 TraceCheckUtils]: 20: Hoare triple {1243#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {1243#false} is VALID [2018-11-23 11:55:31,826 INFO L273 TraceCheckUtils]: 21: Hoare triple {1243#false} assume !#t~short6; {1243#false} is VALID [2018-11-23 11:55:31,826 INFO L273 TraceCheckUtils]: 22: Hoare triple {1243#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {1243#false} is VALID [2018-11-23 11:55:31,827 INFO L273 TraceCheckUtils]: 23: Hoare triple {1243#false} ~i~0 := 1 + ~i~0; {1243#false} is VALID [2018-11-23 11:55:31,827 INFO L273 TraceCheckUtils]: 24: Hoare triple {1243#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {1243#false} is VALID [2018-11-23 11:55:31,827 INFO L273 TraceCheckUtils]: 25: Hoare triple {1243#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {1243#false} is VALID [2018-11-23 11:55:31,827 INFO L273 TraceCheckUtils]: 26: Hoare triple {1243#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {1243#false} is VALID [2018-11-23 11:55:31,828 INFO L273 TraceCheckUtils]: 27: Hoare triple {1243#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {1243#false} is VALID [2018-11-23 11:55:31,828 INFO L273 TraceCheckUtils]: 28: Hoare triple {1243#false} assume !#t~short6; {1243#false} is VALID [2018-11-23 11:55:31,828 INFO L273 TraceCheckUtils]: 29: Hoare triple {1243#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {1243#false} is VALID [2018-11-23 11:55:31,828 INFO L273 TraceCheckUtils]: 30: Hoare triple {1243#false} ~i~0 := 1 + ~i~0; {1243#false} is VALID [2018-11-23 11:55:31,829 INFO L273 TraceCheckUtils]: 31: Hoare triple {1243#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {1243#false} is VALID [2018-11-23 11:55:31,829 INFO L273 TraceCheckUtils]: 32: Hoare triple {1243#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {1243#false} is VALID [2018-11-23 11:55:31,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {1243#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {1243#false} is VALID [2018-11-23 11:55:31,830 INFO L273 TraceCheckUtils]: 34: Hoare triple {1243#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {1243#false} is VALID [2018-11-23 11:55:31,830 INFO L273 TraceCheckUtils]: 35: Hoare triple {1243#false} assume !#t~short6; {1243#false} is VALID [2018-11-23 11:55:31,830 INFO L273 TraceCheckUtils]: 36: Hoare triple {1243#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {1243#false} is VALID [2018-11-23 11:55:31,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {1243#false} ~i~0 := 1 + ~i~0; {1243#false} is VALID [2018-11-23 11:55:31,831 INFO L273 TraceCheckUtils]: 38: Hoare triple {1243#false} assume !(~i~0 < 100000); {1243#false} is VALID [2018-11-23 11:55:31,831 INFO L256 TraceCheckUtils]: 39: Hoare triple {1243#false} call __VERIFIER_assert(~f~0); {1243#false} is VALID [2018-11-23 11:55:31,831 INFO L273 TraceCheckUtils]: 40: Hoare triple {1243#false} ~cond := #in~cond; {1243#false} is VALID [2018-11-23 11:55:31,832 INFO L273 TraceCheckUtils]: 41: Hoare triple {1243#false} assume 0 == ~cond; {1243#false} is VALID [2018-11-23 11:55:31,832 INFO L273 TraceCheckUtils]: 42: Hoare triple {1243#false} assume !false; {1243#false} is VALID [2018-11-23 11:55:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 11:55:31,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:31,836 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 11:55:31,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:31,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:55:31,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:31,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:32,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 11:55:32,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 11:55:32,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:55:32,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:55:32,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:55:32,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-23 11:55:32,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-23 11:55:32,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 11:55:32,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:55:32,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:55:32,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-23 11:55:32,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:55:32,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:55:32,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-23 11:55:32,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:55:32,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:55:32,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:55:32,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:69, output treesize:19 [2018-11-23 11:55:32,882 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:55:32,882 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#b~0.base|, v_main_~i~0_19, |main_~#b~0.offset|, v_prenex_4, v_prenex_1, v_prenex_2, v_prenex_3]. (let ((.cse0 (< main_~i~0 100000)) (.cse2 (* 4 main_~i~0))) (or (let ((.cse1 (select |#memory_int| |main_~#b~0.base|))) (and (< v_main_~i~0_19 100000) .cse0 (<= 99999 v_main_~i~0_19) (= (select .cse1 (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1) (= 0 (select .cse1 (+ .cse2 |main_~#b~0.offset|))) |main_#t~short3|)) (let ((.cse3 (select v_prenex_4 v_prenex_1))) (and .cse0 (< v_prenex_2 100000) (<= 99999 v_prenex_2) (= (select .cse3 (+ (* 4 v_prenex_2) v_prenex_3)) 1) (not |main_#t~short3|) (not (= 0 (select .cse3 (+ .cse2 v_prenex_3)))))))) [2018-11-23 11:55:32,882 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (< main_~i~0 100000))) (or (and .cse0 (or (<= main_~i~0 99998) (<= 100000 main_~i~0)) |main_#t~short3|) (and .cse0 (not |main_#t~short3|)))) [2018-11-23 11:55:33,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {1242#true} call ULTIMATE.init(); {1242#true} is VALID [2018-11-23 11:55:33,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {1242#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1242#true} is VALID [2018-11-23 11:55:33,350 INFO L273 TraceCheckUtils]: 2: Hoare triple {1242#true} assume true; {1242#true} is VALID [2018-11-23 11:55:33,350 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1242#true} {1242#true} #79#return; {1242#true} is VALID [2018-11-23 11:55:33,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {1242#true} call #t~ret7 := main(); {1242#true} is VALID [2018-11-23 11:55:33,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {1242#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1242#true} is VALID [2018-11-23 11:55:33,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {1242#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1242#true} is VALID [2018-11-23 11:55:33,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {1242#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1242#true} is VALID [2018-11-23 11:55:33,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {1242#true} ~i~0 := 1 + ~i~0; {1242#true} is VALID [2018-11-23 11:55:33,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {1242#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1242#true} is VALID [2018-11-23 11:55:33,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {1242#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1242#true} is VALID [2018-11-23 11:55:33,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {1242#true} ~i~0 := 1 + ~i~0; {1242#true} is VALID [2018-11-23 11:55:33,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {1242#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1287#(< main_~i~0 100000)} is VALID [2018-11-23 11:55:33,365 INFO L273 TraceCheckUtils]: 13: Hoare triple {1287#(< main_~i~0 100000)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1291#(and (< main_~i~0 100000) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))))} is VALID [2018-11-23 11:55:33,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {1291#(and (< main_~i~0 100000) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))))} ~i~0 := 1 + ~i~0; {1295#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= main_~i~0 (+ v_main_~i~0_19 1)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {1295#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= main_~i~0 (+ v_main_~i~0_19 1)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} assume !(~i~0 < 100000); {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} ~f~0 := 1;~i~0 := 0; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,374 INFO L273 TraceCheckUtils]: 18: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,374 INFO L273 TraceCheckUtils]: 19: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,378 INFO L273 TraceCheckUtils]: 21: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} assume !#t~short6; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,379 INFO L273 TraceCheckUtils]: 23: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} ~i~0 := 1 + ~i~0; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,379 INFO L273 TraceCheckUtils]: 24: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,380 INFO L273 TraceCheckUtils]: 25: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,398 INFO L273 TraceCheckUtils]: 26: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,407 INFO L273 TraceCheckUtils]: 27: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,421 INFO L273 TraceCheckUtils]: 28: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} assume !#t~short6; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,430 INFO L273 TraceCheckUtils]: 29: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,443 INFO L273 TraceCheckUtils]: 30: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} ~i~0 := 1 + ~i~0; {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} is VALID [2018-11-23 11:55:33,456 INFO L273 TraceCheckUtils]: 31: Hoare triple {1299#(exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {1348#(and (exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1))) (< main_~i~0 100000))} is VALID [2018-11-23 11:55:33,462 INFO L273 TraceCheckUtils]: 32: Hoare triple {1348#(and (exists ((v_main_~i~0_19 Int)) (and (< v_main_~i~0_19 100000) (<= 99999 v_main_~i~0_19) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_main_~i~0_19) |main_~#b~0.offset|)) 1))) (< main_~i~0 100000))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {1352#(or (<= main_~i~0 99998) (and (< main_~i~0 100000) (not |main_#t~short3|)))} is VALID [2018-11-23 11:55:33,463 INFO L273 TraceCheckUtils]: 33: Hoare triple {1352#(or (<= main_~i~0 99998) (and (< main_~i~0 100000) (not |main_#t~short3|)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {1356#(<= main_~i~0 99998)} is VALID [2018-11-23 11:55:33,464 INFO L273 TraceCheckUtils]: 34: Hoare triple {1356#(<= main_~i~0 99998)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {1356#(<= main_~i~0 99998)} is VALID [2018-11-23 11:55:33,468 INFO L273 TraceCheckUtils]: 35: Hoare triple {1356#(<= main_~i~0 99998)} assume !#t~short6; {1356#(<= main_~i~0 99998)} is VALID [2018-11-23 11:55:33,468 INFO L273 TraceCheckUtils]: 36: Hoare triple {1356#(<= main_~i~0 99998)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {1356#(<= main_~i~0 99998)} is VALID [2018-11-23 11:55:33,469 INFO L273 TraceCheckUtils]: 37: Hoare triple {1356#(<= main_~i~0 99998)} ~i~0 := 1 + ~i~0; {1287#(< main_~i~0 100000)} is VALID [2018-11-23 11:55:33,469 INFO L273 TraceCheckUtils]: 38: Hoare triple {1287#(< main_~i~0 100000)} assume !(~i~0 < 100000); {1243#false} is VALID [2018-11-23 11:55:33,470 INFO L256 TraceCheckUtils]: 39: Hoare triple {1243#false} call __VERIFIER_assert(~f~0); {1243#false} is VALID [2018-11-23 11:55:33,470 INFO L273 TraceCheckUtils]: 40: Hoare triple {1243#false} ~cond := #in~cond; {1243#false} is VALID [2018-11-23 11:55:33,470 INFO L273 TraceCheckUtils]: 41: Hoare triple {1243#false} assume 0 == ~cond; {1243#false} is VALID [2018-11-23 11:55:33,470 INFO L273 TraceCheckUtils]: 42: Hoare triple {1243#false} assume !false; {1243#false} is VALID [2018-11-23 11:55:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 11:55:33,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:33,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-11-23 11:55:33,507 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 11:55:33,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:33,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:55:33,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:33,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:55:33,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:55:33,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:55:33,618 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand 13 states. [2018-11-23 11:55:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,268 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2018-11-23 11:55:36,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:55:36,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 11:55:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:55:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 229 transitions. [2018-11-23 11:55:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:55:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 229 transitions. [2018-11-23 11:55:36,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 229 transitions. [2018-11-23 11:55:36,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:36,743 INFO L225 Difference]: With dead ends: 224 [2018-11-23 11:55:36,744 INFO L226 Difference]: Without dead ends: 184 [2018-11-23 11:55:36,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=272, Invalid=598, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:55:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-23 11:55:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 168. [2018-11-23 11:55:36,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:36,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand 168 states. [2018-11-23 11:55:36,820 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 168 states. [2018-11-23 11:55:36,820 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 168 states. [2018-11-23 11:55:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,827 INFO L93 Difference]: Finished difference Result 184 states and 258 transitions. [2018-11-23 11:55:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2018-11-23 11:55:36,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:36,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:36,829 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 184 states. [2018-11-23 11:55:36,829 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 184 states. [2018-11-23 11:55:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,837 INFO L93 Difference]: Finished difference Result 184 states and 258 transitions. [2018-11-23 11:55:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2018-11-23 11:55:36,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:36,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:36,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:36,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 11:55:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 237 transitions. [2018-11-23 11:55:36,845 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 237 transitions. Word has length 43 [2018-11-23 11:55:36,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:36,846 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 237 transitions. [2018-11-23 11:55:36,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:55:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 237 transitions. [2018-11-23 11:55:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 11:55:36,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:36,848 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:36,848 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:36,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash 949112366, now seen corresponding path program 1 times [2018-11-23 11:55:36,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:36,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:36,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,053 INFO L256 TraceCheckUtils]: 0: Hoare triple {2245#true} call ULTIMATE.init(); {2245#true} is VALID [2018-11-23 11:55:37,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {2245#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2245#true} is VALID [2018-11-23 11:55:37,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {2245#true} assume true; {2245#true} is VALID [2018-11-23 11:55:37,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2245#true} {2245#true} #79#return; {2245#true} is VALID [2018-11-23 11:55:37,055 INFO L256 TraceCheckUtils]: 4: Hoare triple {2245#true} call #t~ret7 := main(); {2245#true} is VALID [2018-11-23 11:55:37,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {2245#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2247#(= main_~i~0 0)} is VALID [2018-11-23 11:55:37,058 INFO L273 TraceCheckUtils]: 6: Hoare triple {2247#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2247#(= main_~i~0 0)} is VALID [2018-11-23 11:55:37,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {2247#(= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2247#(= main_~i~0 0)} is VALID [2018-11-23 11:55:37,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {2247#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2248#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:37,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {2248#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2248#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:37,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {2248#(<= main_~i~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2248#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:37,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {2248#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2249#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:37,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {2249#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2249#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:37,070 INFO L273 TraceCheckUtils]: 13: Hoare triple {2249#(<= main_~i~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2249#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:37,070 INFO L273 TraceCheckUtils]: 14: Hoare triple {2249#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2250#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:37,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {2250#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2250#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:37,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {2250#(<= main_~i~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2250#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:37,075 INFO L273 TraceCheckUtils]: 17: Hoare triple {2250#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2251#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:37,075 INFO L273 TraceCheckUtils]: 18: Hoare triple {2251#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2251#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:37,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {2251#(<= main_~i~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2251#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:37,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {2251#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2252#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:37,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {2252#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2252#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:37,079 INFO L273 TraceCheckUtils]: 22: Hoare triple {2252#(<= main_~i~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2252#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:37,079 INFO L273 TraceCheckUtils]: 23: Hoare triple {2252#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2253#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:37,080 INFO L273 TraceCheckUtils]: 24: Hoare triple {2253#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2246#false} is VALID [2018-11-23 11:55:37,080 INFO L273 TraceCheckUtils]: 25: Hoare triple {2246#false} ~f~0 := 1;~i~0 := 0; {2246#false} is VALID [2018-11-23 11:55:37,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {2246#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {2246#false} is VALID [2018-11-23 11:55:37,081 INFO L273 TraceCheckUtils]: 27: Hoare triple {2246#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {2246#false} is VALID [2018-11-23 11:55:37,081 INFO L273 TraceCheckUtils]: 28: Hoare triple {2246#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {2246#false} is VALID [2018-11-23 11:55:37,081 INFO L273 TraceCheckUtils]: 29: Hoare triple {2246#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {2246#false} is VALID [2018-11-23 11:55:37,081 INFO L273 TraceCheckUtils]: 30: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 11:55:37,081 INFO L273 TraceCheckUtils]: 31: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {2246#false} is VALID [2018-11-23 11:55:37,081 INFO L273 TraceCheckUtils]: 32: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 11:55:37,082 INFO L273 TraceCheckUtils]: 33: Hoare triple {2246#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {2246#false} is VALID [2018-11-23 11:55:37,082 INFO L273 TraceCheckUtils]: 34: Hoare triple {2246#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {2246#false} is VALID [2018-11-23 11:55:37,082 INFO L273 TraceCheckUtils]: 35: Hoare triple {2246#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {2246#false} is VALID [2018-11-23 11:55:37,082 INFO L273 TraceCheckUtils]: 36: Hoare triple {2246#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {2246#false} is VALID [2018-11-23 11:55:37,082 INFO L273 TraceCheckUtils]: 37: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 11:55:37,082 INFO L273 TraceCheckUtils]: 38: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {2246#false} is VALID [2018-11-23 11:55:37,083 INFO L273 TraceCheckUtils]: 39: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 11:55:37,083 INFO L273 TraceCheckUtils]: 40: Hoare triple {2246#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {2246#false} is VALID [2018-11-23 11:55:37,083 INFO L273 TraceCheckUtils]: 41: Hoare triple {2246#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {2246#false} is VALID [2018-11-23 11:55:37,083 INFO L273 TraceCheckUtils]: 42: Hoare triple {2246#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {2246#false} is VALID [2018-11-23 11:55:37,083 INFO L273 TraceCheckUtils]: 43: Hoare triple {2246#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {2246#false} is VALID [2018-11-23 11:55:37,083 INFO L273 TraceCheckUtils]: 44: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 11:55:37,084 INFO L273 TraceCheckUtils]: 45: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {2246#false} is VALID [2018-11-23 11:55:37,084 INFO L273 TraceCheckUtils]: 46: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 11:55:37,084 INFO L273 TraceCheckUtils]: 47: Hoare triple {2246#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {2246#false} is VALID [2018-11-23 11:55:37,084 INFO L273 TraceCheckUtils]: 48: Hoare triple {2246#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {2246#false} is VALID [2018-11-23 11:55:37,084 INFO L273 TraceCheckUtils]: 49: Hoare triple {2246#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {2246#false} is VALID [2018-11-23 11:55:37,084 INFO L273 TraceCheckUtils]: 50: Hoare triple {2246#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {2246#false} is VALID [2018-11-23 11:55:37,085 INFO L273 TraceCheckUtils]: 51: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 11:55:37,085 INFO L273 TraceCheckUtils]: 52: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {2246#false} is VALID [2018-11-23 11:55:37,085 INFO L273 TraceCheckUtils]: 53: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 11:55:37,085 INFO L273 TraceCheckUtils]: 54: Hoare triple {2246#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {2246#false} is VALID [2018-11-23 11:55:37,085 INFO L273 TraceCheckUtils]: 55: Hoare triple {2246#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {2246#false} is VALID [2018-11-23 11:55:37,086 INFO L273 TraceCheckUtils]: 56: Hoare triple {2246#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {2246#false} is VALID [2018-11-23 11:55:37,086 INFO L273 TraceCheckUtils]: 57: Hoare triple {2246#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {2246#false} is VALID [2018-11-23 11:55:37,086 INFO L273 TraceCheckUtils]: 58: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 11:55:37,086 INFO L273 TraceCheckUtils]: 59: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {2246#false} is VALID [2018-11-23 11:55:37,086 INFO L273 TraceCheckUtils]: 60: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 11:55:37,086 INFO L273 TraceCheckUtils]: 61: Hoare triple {2246#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {2246#false} is VALID [2018-11-23 11:55:37,087 INFO L273 TraceCheckUtils]: 62: Hoare triple {2246#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {2246#false} is VALID [2018-11-23 11:55:37,087 INFO L273 TraceCheckUtils]: 63: Hoare triple {2246#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {2246#false} is VALID [2018-11-23 11:55:37,087 INFO L273 TraceCheckUtils]: 64: Hoare triple {2246#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {2246#false} is VALID [2018-11-23 11:55:37,087 INFO L273 TraceCheckUtils]: 65: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 11:55:37,088 INFO L273 TraceCheckUtils]: 66: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {2246#false} is VALID [2018-11-23 11:55:37,088 INFO L273 TraceCheckUtils]: 67: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 11:55:37,088 INFO L273 TraceCheckUtils]: 68: Hoare triple {2246#false} assume !(~i~0 < 100000); {2246#false} is VALID [2018-11-23 11:55:37,088 INFO L256 TraceCheckUtils]: 69: Hoare triple {2246#false} call __VERIFIER_assert(~f~0); {2246#false} is VALID [2018-11-23 11:55:37,088 INFO L273 TraceCheckUtils]: 70: Hoare triple {2246#false} ~cond := #in~cond; {2246#false} is VALID [2018-11-23 11:55:37,088 INFO L273 TraceCheckUtils]: 71: Hoare triple {2246#false} assume 0 == ~cond; {2246#false} is VALID [2018-11-23 11:55:37,089 INFO L273 TraceCheckUtils]: 72: Hoare triple {2246#false} assume !false; {2246#false} is VALID [2018-11-23 11:55:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-23 11:55:37,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:37,092 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 11:55:37,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:37,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {2245#true} call ULTIMATE.init(); {2245#true} is VALID [2018-11-23 11:55:37,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {2245#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2245#true} is VALID [2018-11-23 11:55:37,581 INFO L273 TraceCheckUtils]: 2: Hoare triple {2245#true} assume true; {2245#true} is VALID [2018-11-23 11:55:37,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2245#true} {2245#true} #79#return; {2245#true} is VALID [2018-11-23 11:55:37,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {2245#true} call #t~ret7 := main(); {2245#true} is VALID [2018-11-23 11:55:37,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {2245#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2272#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:37,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {2272#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2272#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:37,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {2272#(<= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2272#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:37,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {2272#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2248#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:37,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {2248#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2248#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:37,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {2248#(<= main_~i~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2248#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:37,590 INFO L273 TraceCheckUtils]: 11: Hoare triple {2248#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2249#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:37,591 INFO L273 TraceCheckUtils]: 12: Hoare triple {2249#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2249#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:37,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {2249#(<= main_~i~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2249#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:37,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {2249#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2250#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:37,593 INFO L273 TraceCheckUtils]: 15: Hoare triple {2250#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2250#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:37,593 INFO L273 TraceCheckUtils]: 16: Hoare triple {2250#(<= main_~i~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2250#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:37,594 INFO L273 TraceCheckUtils]: 17: Hoare triple {2250#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2251#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:37,595 INFO L273 TraceCheckUtils]: 18: Hoare triple {2251#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2251#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:37,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {2251#(<= main_~i~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2251#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:37,596 INFO L273 TraceCheckUtils]: 20: Hoare triple {2251#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2252#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:37,597 INFO L273 TraceCheckUtils]: 21: Hoare triple {2252#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2252#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:37,597 INFO L273 TraceCheckUtils]: 22: Hoare triple {2252#(<= main_~i~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2252#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:37,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {2252#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2253#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:37,599 INFO L273 TraceCheckUtils]: 24: Hoare triple {2253#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2246#false} is VALID [2018-11-23 11:55:37,599 INFO L273 TraceCheckUtils]: 25: Hoare triple {2246#false} ~f~0 := 1;~i~0 := 0; {2246#false} is VALID [2018-11-23 11:55:37,599 INFO L273 TraceCheckUtils]: 26: Hoare triple {2246#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {2246#false} is VALID [2018-11-23 11:55:37,599 INFO L273 TraceCheckUtils]: 27: Hoare triple {2246#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {2246#false} is VALID [2018-11-23 11:55:37,600 INFO L273 TraceCheckUtils]: 28: Hoare triple {2246#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {2246#false} is VALID [2018-11-23 11:55:37,600 INFO L273 TraceCheckUtils]: 29: Hoare triple {2246#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {2246#false} is VALID [2018-11-23 11:55:37,600 INFO L273 TraceCheckUtils]: 30: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 11:55:37,600 INFO L273 TraceCheckUtils]: 31: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {2246#false} is VALID [2018-11-23 11:55:37,601 INFO L273 TraceCheckUtils]: 32: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 11:55:37,601 INFO L273 TraceCheckUtils]: 33: Hoare triple {2246#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {2246#false} is VALID [2018-11-23 11:55:37,601 INFO L273 TraceCheckUtils]: 34: Hoare triple {2246#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {2246#false} is VALID [2018-11-23 11:55:37,601 INFO L273 TraceCheckUtils]: 35: Hoare triple {2246#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {2246#false} is VALID [2018-11-23 11:55:37,602 INFO L273 TraceCheckUtils]: 36: Hoare triple {2246#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {2246#false} is VALID [2018-11-23 11:55:37,602 INFO L273 TraceCheckUtils]: 37: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 11:55:37,602 INFO L273 TraceCheckUtils]: 38: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {2246#false} is VALID [2018-11-23 11:55:37,602 INFO L273 TraceCheckUtils]: 39: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 11:55:37,603 INFO L273 TraceCheckUtils]: 40: Hoare triple {2246#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {2246#false} is VALID [2018-11-23 11:55:37,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {2246#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {2246#false} is VALID [2018-11-23 11:55:37,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {2246#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {2246#false} is VALID [2018-11-23 11:55:37,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {2246#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {2246#false} is VALID [2018-11-23 11:55:37,604 INFO L273 TraceCheckUtils]: 44: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 11:55:37,604 INFO L273 TraceCheckUtils]: 45: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {2246#false} is VALID [2018-11-23 11:55:37,604 INFO L273 TraceCheckUtils]: 46: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 11:55:37,604 INFO L273 TraceCheckUtils]: 47: Hoare triple {2246#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {2246#false} is VALID [2018-11-23 11:55:37,604 INFO L273 TraceCheckUtils]: 48: Hoare triple {2246#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {2246#false} is VALID [2018-11-23 11:55:37,604 INFO L273 TraceCheckUtils]: 49: Hoare triple {2246#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {2246#false} is VALID [2018-11-23 11:55:37,604 INFO L273 TraceCheckUtils]: 50: Hoare triple {2246#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {2246#false} is VALID [2018-11-23 11:55:37,605 INFO L273 TraceCheckUtils]: 51: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 11:55:37,605 INFO L273 TraceCheckUtils]: 52: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {2246#false} is VALID [2018-11-23 11:55:37,605 INFO L273 TraceCheckUtils]: 53: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 11:55:37,605 INFO L273 TraceCheckUtils]: 54: Hoare triple {2246#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {2246#false} is VALID [2018-11-23 11:55:37,605 INFO L273 TraceCheckUtils]: 55: Hoare triple {2246#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {2246#false} is VALID [2018-11-23 11:55:37,605 INFO L273 TraceCheckUtils]: 56: Hoare triple {2246#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {2246#false} is VALID [2018-11-23 11:55:37,605 INFO L273 TraceCheckUtils]: 57: Hoare triple {2246#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {2246#false} is VALID [2018-11-23 11:55:37,606 INFO L273 TraceCheckUtils]: 58: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 11:55:37,606 INFO L273 TraceCheckUtils]: 59: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {2246#false} is VALID [2018-11-23 11:55:37,606 INFO L273 TraceCheckUtils]: 60: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 11:55:37,606 INFO L273 TraceCheckUtils]: 61: Hoare triple {2246#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {2246#false} is VALID [2018-11-23 11:55:37,606 INFO L273 TraceCheckUtils]: 62: Hoare triple {2246#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {2246#false} is VALID [2018-11-23 11:55:37,606 INFO L273 TraceCheckUtils]: 63: Hoare triple {2246#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {2246#false} is VALID [2018-11-23 11:55:37,607 INFO L273 TraceCheckUtils]: 64: Hoare triple {2246#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {2246#false} is VALID [2018-11-23 11:55:37,607 INFO L273 TraceCheckUtils]: 65: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 11:55:37,607 INFO L273 TraceCheckUtils]: 66: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {2246#false} is VALID [2018-11-23 11:55:37,607 INFO L273 TraceCheckUtils]: 67: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 11:55:37,607 INFO L273 TraceCheckUtils]: 68: Hoare triple {2246#false} assume !(~i~0 < 100000); {2246#false} is VALID [2018-11-23 11:55:37,608 INFO L256 TraceCheckUtils]: 69: Hoare triple {2246#false} call __VERIFIER_assert(~f~0); {2246#false} is VALID [2018-11-23 11:55:37,608 INFO L273 TraceCheckUtils]: 70: Hoare triple {2246#false} ~cond := #in~cond; {2246#false} is VALID [2018-11-23 11:55:37,608 INFO L273 TraceCheckUtils]: 71: Hoare triple {2246#false} assume 0 == ~cond; {2246#false} is VALID [2018-11-23 11:55:37,608 INFO L273 TraceCheckUtils]: 72: Hoare triple {2246#false} assume !false; {2246#false} is VALID [2018-11-23 11:55:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-23 11:55:37,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:37,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:55:37,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-23 11:55:37,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:37,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:55:37,692 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 11:55:37,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:55:37,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:55:37,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:37,694 INFO L87 Difference]: Start difference. First operand 168 states and 237 transitions. Second operand 10 states. [2018-11-23 11:55:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:38,436 INFO L93 Difference]: Finished difference Result 387 states and 543 transitions. [2018-11-23 11:55:38,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:55:38,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-23 11:55:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2018-11-23 11:55:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2018-11-23 11:55:38,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 152 transitions. [2018-11-23 11:55:38,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:38,629 INFO L225 Difference]: With dead ends: 387 [2018-11-23 11:55:38,629 INFO L226 Difference]: Without dead ends: 246 [2018-11-23 11:55:38,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-23 11:55:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 193. [2018-11-23 11:55:38,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:38,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand 193 states. [2018-11-23 11:55:38,732 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand 193 states. [2018-11-23 11:55:38,732 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 193 states. [2018-11-23 11:55:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:38,741 INFO L93 Difference]: Finished difference Result 246 states and 337 transitions. [2018-11-23 11:55:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 337 transitions. [2018-11-23 11:55:38,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:38,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:38,743 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 246 states. [2018-11-23 11:55:38,743 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 246 states. [2018-11-23 11:55:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:38,753 INFO L93 Difference]: Finished difference Result 246 states and 337 transitions. [2018-11-23 11:55:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 337 transitions. [2018-11-23 11:55:38,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:38,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:38,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:38,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-23 11:55:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2018-11-23 11:55:38,761 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 73 [2018-11-23 11:55:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:38,762 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2018-11-23 11:55:38,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:55:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2018-11-23 11:55:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 11:55:38,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:38,763 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:38,764 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:38,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:38,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1859115339, now seen corresponding path program 2 times [2018-11-23 11:55:38,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:38,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:38,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:38,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:38,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:38,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {3628#true} call ULTIMATE.init(); {3628#true} is VALID [2018-11-23 11:55:39,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {3628#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3628#true} is VALID [2018-11-23 11:55:39,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {3628#true} assume true; {3628#true} is VALID [2018-11-23 11:55:39,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3628#true} {3628#true} #79#return; {3628#true} is VALID [2018-11-23 11:55:39,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {3628#true} call #t~ret7 := main(); {3628#true} is VALID [2018-11-23 11:55:39,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {3628#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3630#(= main_~i~0 0)} is VALID [2018-11-23 11:55:39,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {3630#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3630#(= main_~i~0 0)} is VALID [2018-11-23 11:55:39,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {3630#(= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3630#(= main_~i~0 0)} is VALID [2018-11-23 11:55:39,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {3630#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3631#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:39,003 INFO L273 TraceCheckUtils]: 9: Hoare triple {3631#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3631#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:39,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {3631#(<= main_~i~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3631#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:39,004 INFO L273 TraceCheckUtils]: 11: Hoare triple {3631#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3632#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:39,004 INFO L273 TraceCheckUtils]: 12: Hoare triple {3632#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3632#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:39,005 INFO L273 TraceCheckUtils]: 13: Hoare triple {3632#(<= main_~i~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3632#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:39,005 INFO L273 TraceCheckUtils]: 14: Hoare triple {3632#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3633#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:39,006 INFO L273 TraceCheckUtils]: 15: Hoare triple {3633#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3633#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:39,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {3633#(<= main_~i~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3633#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:39,007 INFO L273 TraceCheckUtils]: 17: Hoare triple {3633#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3634#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:39,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {3634#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3634#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:39,008 INFO L273 TraceCheckUtils]: 19: Hoare triple {3634#(<= main_~i~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3634#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:39,009 INFO L273 TraceCheckUtils]: 20: Hoare triple {3634#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3635#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:39,010 INFO L273 TraceCheckUtils]: 21: Hoare triple {3635#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3635#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:39,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {3635#(<= main_~i~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3635#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:39,011 INFO L273 TraceCheckUtils]: 23: Hoare triple {3635#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3636#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:39,012 INFO L273 TraceCheckUtils]: 24: Hoare triple {3636#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3636#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:39,012 INFO L273 TraceCheckUtils]: 25: Hoare triple {3636#(<= main_~i~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3636#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:39,013 INFO L273 TraceCheckUtils]: 26: Hoare triple {3636#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3637#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:39,014 INFO L273 TraceCheckUtils]: 27: Hoare triple {3637#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3629#false} is VALID [2018-11-23 11:55:39,014 INFO L273 TraceCheckUtils]: 28: Hoare triple {3629#false} ~f~0 := 1;~i~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,014 INFO L273 TraceCheckUtils]: 29: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,014 INFO L273 TraceCheckUtils]: 30: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,014 INFO L273 TraceCheckUtils]: 31: Hoare triple {3629#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,015 INFO L273 TraceCheckUtils]: 32: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,015 INFO L273 TraceCheckUtils]: 33: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,015 INFO L273 TraceCheckUtils]: 34: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,015 INFO L273 TraceCheckUtils]: 35: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,016 INFO L273 TraceCheckUtils]: 36: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,016 INFO L273 TraceCheckUtils]: 37: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,016 INFO L273 TraceCheckUtils]: 38: Hoare triple {3629#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,016 INFO L273 TraceCheckUtils]: 39: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,016 INFO L273 TraceCheckUtils]: 40: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,017 INFO L273 TraceCheckUtils]: 41: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,017 INFO L273 TraceCheckUtils]: 42: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,017 INFO L273 TraceCheckUtils]: 43: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,017 INFO L273 TraceCheckUtils]: 44: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,017 INFO L273 TraceCheckUtils]: 45: Hoare triple {3629#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,017 INFO L273 TraceCheckUtils]: 46: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,017 INFO L273 TraceCheckUtils]: 47: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,018 INFO L273 TraceCheckUtils]: 48: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,018 INFO L273 TraceCheckUtils]: 49: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,018 INFO L273 TraceCheckUtils]: 50: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,018 INFO L273 TraceCheckUtils]: 51: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,018 INFO L273 TraceCheckUtils]: 52: Hoare triple {3629#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,018 INFO L273 TraceCheckUtils]: 53: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,018 INFO L273 TraceCheckUtils]: 54: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,018 INFO L273 TraceCheckUtils]: 55: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,019 INFO L273 TraceCheckUtils]: 56: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,019 INFO L273 TraceCheckUtils]: 57: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,019 INFO L273 TraceCheckUtils]: 58: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,019 INFO L273 TraceCheckUtils]: 59: Hoare triple {3629#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,019 INFO L273 TraceCheckUtils]: 60: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,019 INFO L273 TraceCheckUtils]: 61: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,019 INFO L273 TraceCheckUtils]: 62: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,020 INFO L273 TraceCheckUtils]: 63: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,020 INFO L273 TraceCheckUtils]: 64: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,020 INFO L273 TraceCheckUtils]: 65: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,020 INFO L273 TraceCheckUtils]: 66: Hoare triple {3629#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,020 INFO L273 TraceCheckUtils]: 67: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,020 INFO L273 TraceCheckUtils]: 68: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,020 INFO L273 TraceCheckUtils]: 69: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,021 INFO L273 TraceCheckUtils]: 70: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,021 INFO L273 TraceCheckUtils]: 71: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,021 INFO L273 TraceCheckUtils]: 72: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,021 INFO L273 TraceCheckUtils]: 73: Hoare triple {3629#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {3629#false} is VALID [2018-11-23 11:55:39,021 INFO L273 TraceCheckUtils]: 74: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,021 INFO L273 TraceCheckUtils]: 75: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,021 INFO L273 TraceCheckUtils]: 76: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,022 INFO L273 TraceCheckUtils]: 77: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,022 INFO L273 TraceCheckUtils]: 78: Hoare triple {3629#false} assume !(~i~0 < 100000); {3629#false} is VALID [2018-11-23 11:55:39,022 INFO L256 TraceCheckUtils]: 79: Hoare triple {3629#false} call __VERIFIER_assert(~f~0); {3629#false} is VALID [2018-11-23 11:55:39,022 INFO L273 TraceCheckUtils]: 80: Hoare triple {3629#false} ~cond := #in~cond; {3629#false} is VALID [2018-11-23 11:55:39,022 INFO L273 TraceCheckUtils]: 81: Hoare triple {3629#false} assume 0 == ~cond; {3629#false} is VALID [2018-11-23 11:55:39,022 INFO L273 TraceCheckUtils]: 82: Hoare triple {3629#false} assume !false; {3629#false} is VALID [2018-11-23 11:55:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-23 11:55:39,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:39,026 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 11:55:39,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:39,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:39,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:39,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:39,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {3628#true} call ULTIMATE.init(); {3628#true} is VALID [2018-11-23 11:55:39,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {3628#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3628#true} is VALID [2018-11-23 11:55:39,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {3628#true} assume true; {3628#true} is VALID [2018-11-23 11:55:39,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3628#true} {3628#true} #79#return; {3628#true} is VALID [2018-11-23 11:55:39,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {3628#true} call #t~ret7 := main(); {3628#true} is VALID [2018-11-23 11:55:39,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {3628#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3656#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:39,317 INFO L273 TraceCheckUtils]: 6: Hoare triple {3656#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3656#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:39,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {3656#(<= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3656#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:39,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {3656#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3631#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:39,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {3631#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3631#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:39,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {3631#(<= main_~i~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3631#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:39,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {3631#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3632#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:39,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {3632#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3632#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:39,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {3632#(<= main_~i~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3632#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:39,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {3632#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3633#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:39,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {3633#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3633#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:39,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {3633#(<= main_~i~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3633#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:39,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {3633#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3634#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:39,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {3634#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3634#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:39,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {3634#(<= main_~i~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3634#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:39,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {3634#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3635#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:39,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {3635#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3635#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:39,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {3635#(<= main_~i~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3635#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:39,327 INFO L273 TraceCheckUtils]: 23: Hoare triple {3635#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3636#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:39,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {3636#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3636#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:39,328 INFO L273 TraceCheckUtils]: 25: Hoare triple {3636#(<= main_~i~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3636#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:39,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {3636#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3637#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:39,330 INFO L273 TraceCheckUtils]: 27: Hoare triple {3637#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3629#false} is VALID [2018-11-23 11:55:39,330 INFO L273 TraceCheckUtils]: 28: Hoare triple {3629#false} ~f~0 := 1;~i~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,331 INFO L273 TraceCheckUtils]: 29: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,331 INFO L273 TraceCheckUtils]: 30: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,331 INFO L273 TraceCheckUtils]: 31: Hoare triple {3629#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,331 INFO L273 TraceCheckUtils]: 32: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,332 INFO L273 TraceCheckUtils]: 33: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,332 INFO L273 TraceCheckUtils]: 34: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,332 INFO L273 TraceCheckUtils]: 35: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,333 INFO L273 TraceCheckUtils]: 36: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,333 INFO L273 TraceCheckUtils]: 37: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,333 INFO L273 TraceCheckUtils]: 38: Hoare triple {3629#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,333 INFO L273 TraceCheckUtils]: 39: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,334 INFO L273 TraceCheckUtils]: 40: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,334 INFO L273 TraceCheckUtils]: 41: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,334 INFO L273 TraceCheckUtils]: 42: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,334 INFO L273 TraceCheckUtils]: 43: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,334 INFO L273 TraceCheckUtils]: 44: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,335 INFO L273 TraceCheckUtils]: 45: Hoare triple {3629#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,335 INFO L273 TraceCheckUtils]: 46: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,335 INFO L273 TraceCheckUtils]: 47: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,335 INFO L273 TraceCheckUtils]: 48: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,336 INFO L273 TraceCheckUtils]: 49: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,336 INFO L273 TraceCheckUtils]: 50: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,336 INFO L273 TraceCheckUtils]: 51: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,336 INFO L273 TraceCheckUtils]: 52: Hoare triple {3629#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,336 INFO L273 TraceCheckUtils]: 53: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,337 INFO L273 TraceCheckUtils]: 54: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,337 INFO L273 TraceCheckUtils]: 55: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,337 INFO L273 TraceCheckUtils]: 56: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,337 INFO L273 TraceCheckUtils]: 57: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,337 INFO L273 TraceCheckUtils]: 58: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,338 INFO L273 TraceCheckUtils]: 59: Hoare triple {3629#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,338 INFO L273 TraceCheckUtils]: 60: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,338 INFO L273 TraceCheckUtils]: 61: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,338 INFO L273 TraceCheckUtils]: 62: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,338 INFO L273 TraceCheckUtils]: 63: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,339 INFO L273 TraceCheckUtils]: 64: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,339 INFO L273 TraceCheckUtils]: 65: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,339 INFO L273 TraceCheckUtils]: 66: Hoare triple {3629#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {3629#false} is VALID [2018-11-23 11:55:39,339 INFO L273 TraceCheckUtils]: 67: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,339 INFO L273 TraceCheckUtils]: 68: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,339 INFO L273 TraceCheckUtils]: 69: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,340 INFO L273 TraceCheckUtils]: 70: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,340 INFO L273 TraceCheckUtils]: 71: Hoare triple {3629#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {3629#false} is VALID [2018-11-23 11:55:39,340 INFO L273 TraceCheckUtils]: 72: Hoare triple {3629#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {3629#false} is VALID [2018-11-23 11:55:39,340 INFO L273 TraceCheckUtils]: 73: Hoare triple {3629#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {3629#false} is VALID [2018-11-23 11:55:39,340 INFO L273 TraceCheckUtils]: 74: Hoare triple {3629#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {3629#false} is VALID [2018-11-23 11:55:39,341 INFO L273 TraceCheckUtils]: 75: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 11:55:39,341 INFO L273 TraceCheckUtils]: 76: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {3629#false} is VALID [2018-11-23 11:55:39,341 INFO L273 TraceCheckUtils]: 77: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 11:55:39,341 INFO L273 TraceCheckUtils]: 78: Hoare triple {3629#false} assume !(~i~0 < 100000); {3629#false} is VALID [2018-11-23 11:55:39,341 INFO L256 TraceCheckUtils]: 79: Hoare triple {3629#false} call __VERIFIER_assert(~f~0); {3629#false} is VALID [2018-11-23 11:55:39,342 INFO L273 TraceCheckUtils]: 80: Hoare triple {3629#false} ~cond := #in~cond; {3629#false} is VALID [2018-11-23 11:55:39,342 INFO L273 TraceCheckUtils]: 81: Hoare triple {3629#false} assume 0 == ~cond; {3629#false} is VALID [2018-11-23 11:55:39,342 INFO L273 TraceCheckUtils]: 82: Hoare triple {3629#false} assume !false; {3629#false} is VALID [2018-11-23 11:55:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-23 11:55:39,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:39,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:55:39,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-11-23 11:55:39,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:39,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:55:39,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:39,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:55:39,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:55:39,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:39,440 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand 11 states. [2018-11-23 11:55:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:39,979 INFO L93 Difference]: Finished difference Result 434 states and 611 transitions. [2018-11-23 11:55:39,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:55:39,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-11-23 11:55:39,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2018-11-23 11:55:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2018-11-23 11:55:39,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 167 transitions. [2018-11-23 11:55:40,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:40,689 INFO L225 Difference]: With dead ends: 434 [2018-11-23 11:55:40,689 INFO L226 Difference]: Without dead ends: 271 [2018-11-23 11:55:40,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:40,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-23 11:55:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 218. [2018-11-23 11:55:40,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:40,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand 218 states. [2018-11-23 11:55:40,995 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand 218 states. [2018-11-23 11:55:40,995 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 218 states. [2018-11-23 11:55:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:41,005 INFO L93 Difference]: Finished difference Result 271 states and 373 transitions. [2018-11-23 11:55:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 373 transitions. [2018-11-23 11:55:41,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:41,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:41,006 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 271 states. [2018-11-23 11:55:41,006 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 271 states. [2018-11-23 11:55:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:41,016 INFO L93 Difference]: Finished difference Result 271 states and 373 transitions. [2018-11-23 11:55:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 373 transitions. [2018-11-23 11:55:41,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:41,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:41,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:41,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-23 11:55:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 309 transitions. [2018-11-23 11:55:41,026 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 309 transitions. Word has length 83 [2018-11-23 11:55:41,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:41,026 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 309 transitions. [2018-11-23 11:55:41,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:55:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 309 transitions. [2018-11-23 11:55:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 11:55:41,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:41,028 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:41,028 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:41,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:41,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1243857934, now seen corresponding path program 3 times [2018-11-23 11:55:41,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:41,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:41,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:41,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:41,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:41,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {5172#true} call ULTIMATE.init(); {5172#true} is VALID [2018-11-23 11:55:41,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {5172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5172#true} is VALID [2018-11-23 11:55:41,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {5172#true} assume true; {5172#true} is VALID [2018-11-23 11:55:41,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5172#true} {5172#true} #79#return; {5172#true} is VALID [2018-11-23 11:55:41,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {5172#true} call #t~ret7 := main(); {5172#true} is VALID [2018-11-23 11:55:41,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {5172#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5174#(= main_~i~0 0)} is VALID [2018-11-23 11:55:41,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {5174#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5174#(= main_~i~0 0)} is VALID [2018-11-23 11:55:41,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {5174#(= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5174#(= main_~i~0 0)} is VALID [2018-11-23 11:55:41,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {5174#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5175#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:41,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {5175#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5175#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:41,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {5175#(<= main_~i~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5175#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:41,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {5175#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5176#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:41,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {5176#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5176#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:41,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {5176#(<= main_~i~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5176#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:41,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {5176#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5177#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:41,757 INFO L273 TraceCheckUtils]: 15: Hoare triple {5177#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5177#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:41,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {5177#(<= main_~i~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5177#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:41,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {5177#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5178#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:41,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {5178#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5178#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:41,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {5178#(<= main_~i~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5178#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:41,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {5178#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5179#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:41,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {5179#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5179#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:41,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {5179#(<= main_~i~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5179#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:41,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {5179#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5180#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:41,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {5180#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5180#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:41,763 INFO L273 TraceCheckUtils]: 25: Hoare triple {5180#(<= main_~i~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5180#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:41,763 INFO L273 TraceCheckUtils]: 26: Hoare triple {5180#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5181#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:41,764 INFO L273 TraceCheckUtils]: 27: Hoare triple {5181#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5181#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:41,764 INFO L273 TraceCheckUtils]: 28: Hoare triple {5181#(<= main_~i~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5181#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:41,765 INFO L273 TraceCheckUtils]: 29: Hoare triple {5181#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5182#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:41,766 INFO L273 TraceCheckUtils]: 30: Hoare triple {5182#(<= main_~i~0 8)} assume !(~i~0 < 100000); {5173#false} is VALID [2018-11-23 11:55:41,766 INFO L273 TraceCheckUtils]: 31: Hoare triple {5173#false} ~f~0 := 1;~i~0 := 0; {5173#false} is VALID [2018-11-23 11:55:41,766 INFO L273 TraceCheckUtils]: 32: Hoare triple {5173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5173#false} is VALID [2018-11-23 11:55:41,767 INFO L273 TraceCheckUtils]: 33: Hoare triple {5173#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5173#false} is VALID [2018-11-23 11:55:41,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {5173#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5173#false} is VALID [2018-11-23 11:55:41,767 INFO L273 TraceCheckUtils]: 35: Hoare triple {5173#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5173#false} is VALID [2018-11-23 11:55:41,767 INFO L273 TraceCheckUtils]: 36: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 11:55:41,767 INFO L273 TraceCheckUtils]: 37: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5173#false} is VALID [2018-11-23 11:55:41,768 INFO L273 TraceCheckUtils]: 38: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 11:55:41,768 INFO L273 TraceCheckUtils]: 39: Hoare triple {5173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5173#false} is VALID [2018-11-23 11:55:41,768 INFO L273 TraceCheckUtils]: 40: Hoare triple {5173#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5173#false} is VALID [2018-11-23 11:55:41,768 INFO L273 TraceCheckUtils]: 41: Hoare triple {5173#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5173#false} is VALID [2018-11-23 11:55:41,768 INFO L273 TraceCheckUtils]: 42: Hoare triple {5173#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5173#false} is VALID [2018-11-23 11:55:41,769 INFO L273 TraceCheckUtils]: 43: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 11:55:41,769 INFO L273 TraceCheckUtils]: 44: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5173#false} is VALID [2018-11-23 11:55:41,769 INFO L273 TraceCheckUtils]: 45: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 11:55:41,769 INFO L273 TraceCheckUtils]: 46: Hoare triple {5173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5173#false} is VALID [2018-11-23 11:55:41,769 INFO L273 TraceCheckUtils]: 47: Hoare triple {5173#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5173#false} is VALID [2018-11-23 11:55:41,769 INFO L273 TraceCheckUtils]: 48: Hoare triple {5173#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5173#false} is VALID [2018-11-23 11:55:41,769 INFO L273 TraceCheckUtils]: 49: Hoare triple {5173#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5173#false} is VALID [2018-11-23 11:55:41,770 INFO L273 TraceCheckUtils]: 50: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 11:55:41,770 INFO L273 TraceCheckUtils]: 51: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5173#false} is VALID [2018-11-23 11:55:41,770 INFO L273 TraceCheckUtils]: 52: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 11:55:41,770 INFO L273 TraceCheckUtils]: 53: Hoare triple {5173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5173#false} is VALID [2018-11-23 11:55:41,770 INFO L273 TraceCheckUtils]: 54: Hoare triple {5173#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5173#false} is VALID [2018-11-23 11:55:41,770 INFO L273 TraceCheckUtils]: 55: Hoare triple {5173#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5173#false} is VALID [2018-11-23 11:55:41,770 INFO L273 TraceCheckUtils]: 56: Hoare triple {5173#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5173#false} is VALID [2018-11-23 11:55:41,770 INFO L273 TraceCheckUtils]: 57: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 11:55:41,771 INFO L273 TraceCheckUtils]: 58: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5173#false} is VALID [2018-11-23 11:55:41,771 INFO L273 TraceCheckUtils]: 59: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 11:55:41,771 INFO L273 TraceCheckUtils]: 60: Hoare triple {5173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5173#false} is VALID [2018-11-23 11:55:41,771 INFO L273 TraceCheckUtils]: 61: Hoare triple {5173#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5173#false} is VALID [2018-11-23 11:55:41,771 INFO L273 TraceCheckUtils]: 62: Hoare triple {5173#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5173#false} is VALID [2018-11-23 11:55:41,771 INFO L273 TraceCheckUtils]: 63: Hoare triple {5173#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5173#false} is VALID [2018-11-23 11:55:41,771 INFO L273 TraceCheckUtils]: 64: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 11:55:41,772 INFO L273 TraceCheckUtils]: 65: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5173#false} is VALID [2018-11-23 11:55:41,772 INFO L273 TraceCheckUtils]: 66: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 11:55:41,772 INFO L273 TraceCheckUtils]: 67: Hoare triple {5173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5173#false} is VALID [2018-11-23 11:55:41,772 INFO L273 TraceCheckUtils]: 68: Hoare triple {5173#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5173#false} is VALID [2018-11-23 11:55:41,772 INFO L273 TraceCheckUtils]: 69: Hoare triple {5173#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5173#false} is VALID [2018-11-23 11:55:41,772 INFO L273 TraceCheckUtils]: 70: Hoare triple {5173#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5173#false} is VALID [2018-11-23 11:55:41,772 INFO L273 TraceCheckUtils]: 71: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 11:55:41,772 INFO L273 TraceCheckUtils]: 72: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5173#false} is VALID [2018-11-23 11:55:41,773 INFO L273 TraceCheckUtils]: 73: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 11:55:41,773 INFO L273 TraceCheckUtils]: 74: Hoare triple {5173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5173#false} is VALID [2018-11-23 11:55:41,773 INFO L273 TraceCheckUtils]: 75: Hoare triple {5173#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5173#false} is VALID [2018-11-23 11:55:41,773 INFO L273 TraceCheckUtils]: 76: Hoare triple {5173#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5173#false} is VALID [2018-11-23 11:55:41,773 INFO L273 TraceCheckUtils]: 77: Hoare triple {5173#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5173#false} is VALID [2018-11-23 11:55:41,773 INFO L273 TraceCheckUtils]: 78: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 11:55:41,773 INFO L273 TraceCheckUtils]: 79: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5173#false} is VALID [2018-11-23 11:55:41,774 INFO L273 TraceCheckUtils]: 80: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 11:55:41,774 INFO L273 TraceCheckUtils]: 81: Hoare triple {5173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5173#false} is VALID [2018-11-23 11:55:41,774 INFO L273 TraceCheckUtils]: 82: Hoare triple {5173#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5173#false} is VALID [2018-11-23 11:55:41,774 INFO L273 TraceCheckUtils]: 83: Hoare triple {5173#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {5173#false} is VALID [2018-11-23 11:55:41,774 INFO L273 TraceCheckUtils]: 84: Hoare triple {5173#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5173#false} is VALID [2018-11-23 11:55:41,774 INFO L273 TraceCheckUtils]: 85: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 11:55:41,775 INFO L273 TraceCheckUtils]: 86: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5173#false} is VALID [2018-11-23 11:55:41,775 INFO L273 TraceCheckUtils]: 87: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 11:55:41,775 INFO L273 TraceCheckUtils]: 88: Hoare triple {5173#false} assume !(~i~0 < 100000); {5173#false} is VALID [2018-11-23 11:55:41,775 INFO L256 TraceCheckUtils]: 89: Hoare triple {5173#false} call __VERIFIER_assert(~f~0); {5173#false} is VALID [2018-11-23 11:55:41,775 INFO L273 TraceCheckUtils]: 90: Hoare triple {5173#false} ~cond := #in~cond; {5173#false} is VALID [2018-11-23 11:55:41,776 INFO L273 TraceCheckUtils]: 91: Hoare triple {5173#false} assume 0 == ~cond; {5173#false} is VALID [2018-11-23 11:55:41,776 INFO L273 TraceCheckUtils]: 92: Hoare triple {5173#false} assume !false; {5173#false} is VALID [2018-11-23 11:55:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-23 11:55:41,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:41,782 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 11:55:41,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:41,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 11:55:41,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:41,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:41,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 11:55:41,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 11:55:41,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:55:42,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:55:42,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:55:42,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:55:42,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-23 11:55:42,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:55:42,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-23 11:55:42,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:55:42,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:55:42,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:55:42,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 11:55:43,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-11-23 11:55:43,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:55:43,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 51 [2018-11-23 11:55:43,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:55:43,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:55:43,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-11-23 11:55:43,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:55:43,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:55:43,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:55:43,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:55:43,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2018-11-23 11:55:43,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:55:43,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:55:43,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:55:43,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:87, output treesize:20 [2018-11-23 11:55:43,272 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:55:43,272 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_8, v_prenex_5, v_prenex_6, v_prenex_7, |#memory_int|, |main_~#b~0.base|, |main_~#b~0.offset|, v_main_~i~0_35]. (let ((.cse2 (* 4 main_~i~0))) (or (let ((.cse0 (select v_prenex_8 v_prenex_5)) (.cse1 (* 4 v_prenex_7))) (and (= 1 (select .cse0 (+ v_prenex_6 .cse1))) (not (= 0 (select .cse0 (+ .cse2 v_prenex_6)))) (< v_prenex_7 100000) (<= 99999 v_prenex_7) (= 1 (select .cse0 (+ v_prenex_6 .cse1 (- 4)))) (not |main_#t~short3|))) (let ((.cse3 (select |#memory_int| |main_~#b~0.base|)) (.cse4 (* 4 v_main_~i~0_35))) (and (= 1 (select .cse3 (+ |main_~#b~0.offset| .cse4))) (= 0 (select .cse3 (+ .cse2 |main_~#b~0.offset|))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) |main_#t~short3| (= 1 (select .cse3 (+ |main_~#b~0.offset| .cse4 (- 4)))))))) [2018-11-23 11:55:43,273 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (or (not |main_#t~short3|) (and (or (and (<= 99999 main_~i~0) (<= 100000 main_~i~0)) (and (<= main_~i~0 99998) (<= main_~i~0 99997))) |main_#t~short3|)) [2018-11-23 11:55:43,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {5172#true} call ULTIMATE.init(); {5172#true} is VALID [2018-11-23 11:55:43,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {5172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5172#true} is VALID [2018-11-23 11:55:43,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {5172#true} assume true; {5172#true} is VALID [2018-11-23 11:55:43,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5172#true} {5172#true} #79#return; {5172#true} is VALID [2018-11-23 11:55:43,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {5172#true} call #t~ret7 := main(); {5172#true} is VALID [2018-11-23 11:55:43,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {5172#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5172#true} is VALID [2018-11-23 11:55:43,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {5172#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {5172#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {5172#true} ~i~0 := 1 + ~i~0; {5172#true} is VALID [2018-11-23 11:55:43,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {5172#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {5172#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {5172#true} ~i~0 := 1 + ~i~0; {5172#true} is VALID [2018-11-23 11:55:43,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {5172#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {5172#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {5172#true} ~i~0 := 1 + ~i~0; {5172#true} is VALID [2018-11-23 11:55:43,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {5172#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {5172#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {5172#true} ~i~0 := 1 + ~i~0; {5172#true} is VALID [2018-11-23 11:55:43,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {5172#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,754 INFO L273 TraceCheckUtils]: 19: Hoare triple {5172#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {5172#true} ~i~0 := 1 + ~i~0; {5172#true} is VALID [2018-11-23 11:55:43,755 INFO L273 TraceCheckUtils]: 21: Hoare triple {5172#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,755 INFO L273 TraceCheckUtils]: 22: Hoare triple {5172#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,755 INFO L273 TraceCheckUtils]: 23: Hoare triple {5172#true} ~i~0 := 1 + ~i~0; {5172#true} is VALID [2018-11-23 11:55:43,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {5172#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5172#true} is VALID [2018-11-23 11:55:43,769 INFO L273 TraceCheckUtils]: 25: Hoare triple {5172#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5261#(= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|)))} is VALID [2018-11-23 11:55:43,784 INFO L273 TraceCheckUtils]: 26: Hoare triple {5261#(= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|)))} ~i~0 := 1 + ~i~0; {5265#(= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1)} is VALID [2018-11-23 11:55:43,793 INFO L273 TraceCheckUtils]: 27: Hoare triple {5265#(= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5269#(and (< main_~i~0 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1))} is VALID [2018-11-23 11:55:43,807 INFO L273 TraceCheckUtils]: 28: Hoare triple {5269#(and (< main_~i~0 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1))} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5273#(and (< main_~i~0 100000) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1))} is VALID [2018-11-23 11:55:43,816 INFO L273 TraceCheckUtils]: 29: Hoare triple {5273#(and (< main_~i~0 100000) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1))} ~i~0 := 1 + ~i~0; {5277#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4)))) (<= main_~i~0 (+ v_main_~i~0_35 1))))} is VALID [2018-11-23 11:55:43,829 INFO L273 TraceCheckUtils]: 30: Hoare triple {5277#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4)))) (<= main_~i~0 (+ v_main_~i~0_35 1))))} assume !(~i~0 < 100000); {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,838 INFO L273 TraceCheckUtils]: 31: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} ~f~0 := 1;~i~0 := 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,843 INFO L273 TraceCheckUtils]: 33: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,846 INFO L273 TraceCheckUtils]: 35: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,846 INFO L273 TraceCheckUtils]: 36: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !#t~short6; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,848 INFO L273 TraceCheckUtils]: 37: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,848 INFO L273 TraceCheckUtils]: 38: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} ~i~0 := 1 + ~i~0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,848 INFO L273 TraceCheckUtils]: 39: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,849 INFO L273 TraceCheckUtils]: 40: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,849 INFO L273 TraceCheckUtils]: 41: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,849 INFO L273 TraceCheckUtils]: 42: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,850 INFO L273 TraceCheckUtils]: 43: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !#t~short6; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,850 INFO L273 TraceCheckUtils]: 44: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,850 INFO L273 TraceCheckUtils]: 45: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} ~i~0 := 1 + ~i~0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,851 INFO L273 TraceCheckUtils]: 46: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,851 INFO L273 TraceCheckUtils]: 47: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,852 INFO L273 TraceCheckUtils]: 48: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,852 INFO L273 TraceCheckUtils]: 49: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,853 INFO L273 TraceCheckUtils]: 50: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !#t~short6; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,853 INFO L273 TraceCheckUtils]: 51: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,854 INFO L273 TraceCheckUtils]: 52: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} ~i~0 := 1 + ~i~0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,854 INFO L273 TraceCheckUtils]: 53: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,855 INFO L273 TraceCheckUtils]: 54: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,856 INFO L273 TraceCheckUtils]: 55: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,856 INFO L273 TraceCheckUtils]: 56: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,857 INFO L273 TraceCheckUtils]: 57: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !#t~short6; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,857 INFO L273 TraceCheckUtils]: 58: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,858 INFO L273 TraceCheckUtils]: 59: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} ~i~0 := 1 + ~i~0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,859 INFO L273 TraceCheckUtils]: 60: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,859 INFO L273 TraceCheckUtils]: 61: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,860 INFO L273 TraceCheckUtils]: 62: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,860 INFO L273 TraceCheckUtils]: 63: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,861 INFO L273 TraceCheckUtils]: 64: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !#t~short6; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,861 INFO L273 TraceCheckUtils]: 65: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,862 INFO L273 TraceCheckUtils]: 66: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} ~i~0 := 1 + ~i~0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,863 INFO L273 TraceCheckUtils]: 67: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,863 INFO L273 TraceCheckUtils]: 68: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,864 INFO L273 TraceCheckUtils]: 69: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,864 INFO L273 TraceCheckUtils]: 70: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,865 INFO L273 TraceCheckUtils]: 71: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !#t~short6; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,866 INFO L273 TraceCheckUtils]: 72: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,866 INFO L273 TraceCheckUtils]: 73: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} ~i~0 := 1 + ~i~0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,867 INFO L273 TraceCheckUtils]: 74: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} is VALID [2018-11-23 11:55:43,869 INFO L273 TraceCheckUtils]: 75: Hoare triple {5281#(exists ((v_main_~i~0_35 Int)) (and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35)))) (< v_main_~i~0_35 100000) (<= 99999 v_main_~i~0_35) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_35) (- 4))))))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5417#(or (<= main_~i~0 99997) (<= 100000 main_~i~0) (not |main_#t~short3|))} is VALID [2018-11-23 11:55:43,869 INFO L273 TraceCheckUtils]: 76: Hoare triple {5417#(or (<= main_~i~0 99997) (<= 100000 main_~i~0) (not |main_#t~short3|))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {5421#(or (<= main_~i~0 99997) (<= 100000 main_~i~0))} is VALID [2018-11-23 11:55:43,870 INFO L273 TraceCheckUtils]: 77: Hoare triple {5421#(or (<= main_~i~0 99997) (<= 100000 main_~i~0))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5421#(or (<= main_~i~0 99997) (<= 100000 main_~i~0))} is VALID [2018-11-23 11:55:43,870 INFO L273 TraceCheckUtils]: 78: Hoare triple {5421#(or (<= main_~i~0 99997) (<= 100000 main_~i~0))} assume !#t~short6; {5421#(or (<= main_~i~0 99997) (<= 100000 main_~i~0))} is VALID [2018-11-23 11:55:43,871 INFO L273 TraceCheckUtils]: 79: Hoare triple {5421#(or (<= main_~i~0 99997) (<= 100000 main_~i~0))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5421#(or (<= main_~i~0 99997) (<= 100000 main_~i~0))} is VALID [2018-11-23 11:55:43,872 INFO L273 TraceCheckUtils]: 80: Hoare triple {5421#(or (<= main_~i~0 99997) (<= 100000 main_~i~0))} ~i~0 := 1 + ~i~0; {5434#(or (<= 100001 main_~i~0) (<= main_~i~0 99998))} is VALID [2018-11-23 11:55:43,873 INFO L273 TraceCheckUtils]: 81: Hoare triple {5434#(or (<= 100001 main_~i~0) (<= main_~i~0 99998))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {5438#(<= main_~i~0 99998)} is VALID [2018-11-23 11:55:43,873 INFO L273 TraceCheckUtils]: 82: Hoare triple {5438#(<= main_~i~0 99998)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {5438#(<= main_~i~0 99998)} is VALID [2018-11-23 11:55:43,874 INFO L273 TraceCheckUtils]: 83: Hoare triple {5438#(<= main_~i~0 99998)} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {5438#(<= main_~i~0 99998)} is VALID [2018-11-23 11:55:43,875 INFO L273 TraceCheckUtils]: 84: Hoare triple {5438#(<= main_~i~0 99998)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {5438#(<= main_~i~0 99998)} is VALID [2018-11-23 11:55:43,875 INFO L273 TraceCheckUtils]: 85: Hoare triple {5438#(<= main_~i~0 99998)} assume !#t~short6; {5438#(<= main_~i~0 99998)} is VALID [2018-11-23 11:55:43,876 INFO L273 TraceCheckUtils]: 86: Hoare triple {5438#(<= main_~i~0 99998)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {5438#(<= main_~i~0 99998)} is VALID [2018-11-23 11:55:43,876 INFO L273 TraceCheckUtils]: 87: Hoare triple {5438#(<= main_~i~0 99998)} ~i~0 := 1 + ~i~0; {5457#(<= main_~i~0 99999)} is VALID [2018-11-23 11:55:43,877 INFO L273 TraceCheckUtils]: 88: Hoare triple {5457#(<= main_~i~0 99999)} assume !(~i~0 < 100000); {5173#false} is VALID [2018-11-23 11:55:43,877 INFO L256 TraceCheckUtils]: 89: Hoare triple {5173#false} call __VERIFIER_assert(~f~0); {5173#false} is VALID [2018-11-23 11:55:43,878 INFO L273 TraceCheckUtils]: 90: Hoare triple {5173#false} ~cond := #in~cond; {5173#false} is VALID [2018-11-23 11:55:43,878 INFO L273 TraceCheckUtils]: 91: Hoare triple {5173#false} assume 0 == ~cond; {5173#false} is VALID [2018-11-23 11:55:43,878 INFO L273 TraceCheckUtils]: 92: Hoare triple {5173#false} assume !false; {5173#false} is VALID [2018-11-23 11:55:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 34 proven. 88 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-11-23 11:55:43,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:43,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-11-23 11:55:43,928 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2018-11-23 11:55:43,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:43,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:55:44,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:44,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:55:44,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:55:44,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:55:44,010 INFO L87 Difference]: Start difference. First operand 218 states and 309 transitions. Second operand 22 states. [2018-11-23 11:56:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:24,597 INFO L93 Difference]: Finished difference Result 769 states and 1092 transitions. [2018-11-23 11:56:24,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-23 11:56:24,597 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2018-11-23 11:56:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:56:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 474 transitions. [2018-11-23 11:56:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:56:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 474 transitions. [2018-11-23 11:56:24,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 474 transitions. [2018-11-23 11:56:25,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:25,432 INFO L225 Difference]: With dead ends: 769 [2018-11-23 11:56:25,432 INFO L226 Difference]: Without dead ends: 584 [2018-11-23 11:56:25,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2329 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=1616, Invalid=5518, Unknown=6, NotChecked=0, Total=7140 [2018-11-23 11:56:25,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-11-23 11:56:25,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 457. [2018-11-23 11:56:25,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:25,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand 457 states. [2018-11-23 11:56:25,835 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand 457 states. [2018-11-23 11:56:25,835 INFO L87 Difference]: Start difference. First operand 584 states. Second operand 457 states. [2018-11-23 11:56:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:25,859 INFO L93 Difference]: Finished difference Result 584 states and 802 transitions. [2018-11-23 11:56:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 802 transitions. [2018-11-23 11:56:25,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:25,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:25,861 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand 584 states. [2018-11-23 11:56:25,861 INFO L87 Difference]: Start difference. First operand 457 states. Second operand 584 states. [2018-11-23 11:56:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:25,883 INFO L93 Difference]: Finished difference Result 584 states and 802 transitions. [2018-11-23 11:56:25,883 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 802 transitions. [2018-11-23 11:56:25,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:25,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:25,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:25,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-11-23 11:56:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 655 transitions. [2018-11-23 11:56:25,902 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 655 transitions. Word has length 93 [2018-11-23 11:56:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:25,902 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 655 transitions. [2018-11-23 11:56:25,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:56:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 655 transitions. [2018-11-23 11:56:25,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 11:56:25,905 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:25,905 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:25,905 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:25,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:25,906 INFO L82 PathProgramCache]: Analyzing trace with hash 175633360, now seen corresponding path program 4 times [2018-11-23 11:56:25,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:25,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:25,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:25,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:25,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:26,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {8177#true} call ULTIMATE.init(); {8177#true} is VALID [2018-11-23 11:56:26,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {8177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8177#true} is VALID [2018-11-23 11:56:26,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {8177#true} assume true; {8177#true} is VALID [2018-11-23 11:56:26,709 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8177#true} {8177#true} #79#return; {8177#true} is VALID [2018-11-23 11:56:26,709 INFO L256 TraceCheckUtils]: 4: Hoare triple {8177#true} call #t~ret7 := main(); {8177#true} is VALID [2018-11-23 11:56:26,710 INFO L273 TraceCheckUtils]: 5: Hoare triple {8177#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8179#(= main_~i~0 0)} is VALID [2018-11-23 11:56:26,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {8179#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8179#(= main_~i~0 0)} is VALID [2018-11-23 11:56:26,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {8179#(= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8179#(= main_~i~0 0)} is VALID [2018-11-23 11:56:26,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {8179#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8180#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:26,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {8180#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8180#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:26,712 INFO L273 TraceCheckUtils]: 10: Hoare triple {8180#(<= main_~i~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8180#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:26,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {8180#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8181#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:26,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {8181#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8181#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:26,713 INFO L273 TraceCheckUtils]: 13: Hoare triple {8181#(<= main_~i~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8181#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:26,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {8181#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8182#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:26,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {8182#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8182#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:26,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {8182#(<= main_~i~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8182#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:26,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {8182#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8183#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:26,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {8183#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8183#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:26,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {8183#(<= main_~i~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8183#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:26,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {8183#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8184#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:26,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {8184#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8184#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:26,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {8184#(<= main_~i~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8184#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:26,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {8184#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8185#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:26,720 INFO L273 TraceCheckUtils]: 24: Hoare triple {8185#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8185#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:26,721 INFO L273 TraceCheckUtils]: 25: Hoare triple {8185#(<= main_~i~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8185#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:26,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {8185#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8186#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:26,722 INFO L273 TraceCheckUtils]: 27: Hoare triple {8186#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8186#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:26,723 INFO L273 TraceCheckUtils]: 28: Hoare triple {8186#(<= main_~i~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8186#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:26,723 INFO L273 TraceCheckUtils]: 29: Hoare triple {8186#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8187#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:26,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {8187#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8187#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:26,724 INFO L273 TraceCheckUtils]: 31: Hoare triple {8187#(<= main_~i~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8187#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:26,725 INFO L273 TraceCheckUtils]: 32: Hoare triple {8187#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8188#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:26,726 INFO L273 TraceCheckUtils]: 33: Hoare triple {8188#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8188#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:26,745 INFO L273 TraceCheckUtils]: 34: Hoare triple {8188#(<= main_~i~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8188#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:26,758 INFO L273 TraceCheckUtils]: 35: Hoare triple {8188#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8189#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:26,767 INFO L273 TraceCheckUtils]: 36: Hoare triple {8189#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8189#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:26,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {8189#(<= main_~i~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8189#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:26,792 INFO L273 TraceCheckUtils]: 38: Hoare triple {8189#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8190#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:26,799 INFO L273 TraceCheckUtils]: 39: Hoare triple {8190#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8190#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:26,800 INFO L273 TraceCheckUtils]: 40: Hoare triple {8190#(<= main_~i~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8190#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:26,817 INFO L273 TraceCheckUtils]: 41: Hoare triple {8190#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8191#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:26,826 INFO L273 TraceCheckUtils]: 42: Hoare triple {8191#(<= main_~i~0 12)} assume !(~i~0 < 100000); {8178#false} is VALID [2018-11-23 11:56:26,826 INFO L273 TraceCheckUtils]: 43: Hoare triple {8178#false} ~f~0 := 1;~i~0 := 0; {8178#false} is VALID [2018-11-23 11:56:26,826 INFO L273 TraceCheckUtils]: 44: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:26,826 INFO L273 TraceCheckUtils]: 45: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:26,827 INFO L273 TraceCheckUtils]: 46: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:26,827 INFO L273 TraceCheckUtils]: 47: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:26,827 INFO L273 TraceCheckUtils]: 48: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:26,827 INFO L273 TraceCheckUtils]: 49: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:26,827 INFO L273 TraceCheckUtils]: 50: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:26,827 INFO L273 TraceCheckUtils]: 51: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:26,828 INFO L273 TraceCheckUtils]: 52: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:26,828 INFO L273 TraceCheckUtils]: 53: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:26,828 INFO L273 TraceCheckUtils]: 54: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:26,828 INFO L273 TraceCheckUtils]: 55: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:26,828 INFO L273 TraceCheckUtils]: 56: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:26,828 INFO L273 TraceCheckUtils]: 57: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:26,829 INFO L273 TraceCheckUtils]: 58: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:26,829 INFO L273 TraceCheckUtils]: 59: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:26,829 INFO L273 TraceCheckUtils]: 60: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:26,829 INFO L273 TraceCheckUtils]: 61: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:26,829 INFO L273 TraceCheckUtils]: 62: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:26,829 INFO L273 TraceCheckUtils]: 63: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:26,830 INFO L273 TraceCheckUtils]: 64: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:26,830 INFO L273 TraceCheckUtils]: 65: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:26,830 INFO L273 TraceCheckUtils]: 66: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:26,830 INFO L273 TraceCheckUtils]: 67: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:26,830 INFO L273 TraceCheckUtils]: 68: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:26,830 INFO L273 TraceCheckUtils]: 69: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:26,831 INFO L273 TraceCheckUtils]: 70: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:26,831 INFO L273 TraceCheckUtils]: 71: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:26,831 INFO L273 TraceCheckUtils]: 72: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:26,831 INFO L273 TraceCheckUtils]: 73: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:26,831 INFO L273 TraceCheckUtils]: 74: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:26,831 INFO L273 TraceCheckUtils]: 75: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:26,832 INFO L273 TraceCheckUtils]: 76: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:26,832 INFO L273 TraceCheckUtils]: 77: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:26,832 INFO L273 TraceCheckUtils]: 78: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:26,832 INFO L273 TraceCheckUtils]: 79: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:26,832 INFO L273 TraceCheckUtils]: 80: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:26,832 INFO L273 TraceCheckUtils]: 81: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:26,833 INFO L273 TraceCheckUtils]: 82: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:26,833 INFO L273 TraceCheckUtils]: 83: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:26,833 INFO L273 TraceCheckUtils]: 84: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:26,833 INFO L273 TraceCheckUtils]: 85: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:26,833 INFO L273 TraceCheckUtils]: 86: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:26,833 INFO L273 TraceCheckUtils]: 87: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:26,834 INFO L273 TraceCheckUtils]: 88: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:26,834 INFO L273 TraceCheckUtils]: 89: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:26,834 INFO L273 TraceCheckUtils]: 90: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:26,834 INFO L273 TraceCheckUtils]: 91: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:26,834 INFO L273 TraceCheckUtils]: 92: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:26,834 INFO L273 TraceCheckUtils]: 93: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:26,835 INFO L273 TraceCheckUtils]: 94: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:26,835 INFO L273 TraceCheckUtils]: 95: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:26,835 INFO L273 TraceCheckUtils]: 96: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:26,835 INFO L273 TraceCheckUtils]: 97: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:26,835 INFO L273 TraceCheckUtils]: 98: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:26,836 INFO L273 TraceCheckUtils]: 99: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:26,836 INFO L273 TraceCheckUtils]: 100: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:26,836 INFO L273 TraceCheckUtils]: 101: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:26,836 INFO L273 TraceCheckUtils]: 102: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:26,836 INFO L273 TraceCheckUtils]: 103: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:26,836 INFO L273 TraceCheckUtils]: 104: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:26,837 INFO L273 TraceCheckUtils]: 105: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:26,837 INFO L273 TraceCheckUtils]: 106: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:26,837 INFO L273 TraceCheckUtils]: 107: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:26,837 INFO L273 TraceCheckUtils]: 108: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:26,837 INFO L273 TraceCheckUtils]: 109: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:26,837 INFO L273 TraceCheckUtils]: 110: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:26,838 INFO L273 TraceCheckUtils]: 111: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:26,838 INFO L273 TraceCheckUtils]: 112: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:26,838 INFO L273 TraceCheckUtils]: 113: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:26,838 INFO L273 TraceCheckUtils]: 114: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:26,838 INFO L273 TraceCheckUtils]: 115: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:26,838 INFO L273 TraceCheckUtils]: 116: Hoare triple {8178#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {8178#false} is VALID [2018-11-23 11:56:26,839 INFO L273 TraceCheckUtils]: 117: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:26,839 INFO L273 TraceCheckUtils]: 118: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:26,839 INFO L273 TraceCheckUtils]: 119: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:26,839 INFO L273 TraceCheckUtils]: 120: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:26,839 INFO L273 TraceCheckUtils]: 121: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:26,839 INFO L273 TraceCheckUtils]: 122: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:26,840 INFO L273 TraceCheckUtils]: 123: Hoare triple {8178#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {8178#false} is VALID [2018-11-23 11:56:26,840 INFO L273 TraceCheckUtils]: 124: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:26,840 INFO L273 TraceCheckUtils]: 125: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:26,840 INFO L273 TraceCheckUtils]: 126: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:26,840 INFO L273 TraceCheckUtils]: 127: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:26,840 INFO L273 TraceCheckUtils]: 128: Hoare triple {8178#false} assume !(~i~0 < 100000); {8178#false} is VALID [2018-11-23 11:56:26,841 INFO L256 TraceCheckUtils]: 129: Hoare triple {8178#false} call __VERIFIER_assert(~f~0); {8178#false} is VALID [2018-11-23 11:56:26,841 INFO L273 TraceCheckUtils]: 130: Hoare triple {8178#false} ~cond := #in~cond; {8178#false} is VALID [2018-11-23 11:56:26,841 INFO L273 TraceCheckUtils]: 131: Hoare triple {8178#false} assume 0 == ~cond; {8178#false} is VALID [2018-11-23 11:56:26,841 INFO L273 TraceCheckUtils]: 132: Hoare triple {8178#false} assume !false; {8178#false} is VALID [2018-11-23 11:56:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2018-11-23 11:56:26,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:26,851 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 11:56:26,863 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:56:26,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:56:26,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:27,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:27,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {8177#true} call ULTIMATE.init(); {8177#true} is VALID [2018-11-23 11:56:27,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {8177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8177#true} is VALID [2018-11-23 11:56:27,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {8177#true} assume true; {8177#true} is VALID [2018-11-23 11:56:27,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8177#true} {8177#true} #79#return; {8177#true} is VALID [2018-11-23 11:56:27,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {8177#true} call #t~ret7 := main(); {8177#true} is VALID [2018-11-23 11:56:27,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {8177#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8210#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:27,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {8210#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8210#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:27,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {8210#(<= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8210#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:27,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {8210#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8180#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:27,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {8180#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8180#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:27,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {8180#(<= main_~i~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8180#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:27,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {8180#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8181#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:27,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {8181#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8181#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:27,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {8181#(<= main_~i~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8181#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:27,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {8181#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8182#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:27,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {8182#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8182#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:27,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {8182#(<= main_~i~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8182#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:27,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {8182#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8183#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:27,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {8183#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8183#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:27,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {8183#(<= main_~i~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8183#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:27,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {8183#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8184#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:27,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {8184#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8184#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:27,298 INFO L273 TraceCheckUtils]: 22: Hoare triple {8184#(<= main_~i~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8184#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:27,307 INFO L273 TraceCheckUtils]: 23: Hoare triple {8184#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8185#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:27,314 INFO L273 TraceCheckUtils]: 24: Hoare triple {8185#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8185#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:27,315 INFO L273 TraceCheckUtils]: 25: Hoare triple {8185#(<= main_~i~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8185#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:27,315 INFO L273 TraceCheckUtils]: 26: Hoare triple {8185#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8186#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:27,316 INFO L273 TraceCheckUtils]: 27: Hoare triple {8186#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8186#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:27,316 INFO L273 TraceCheckUtils]: 28: Hoare triple {8186#(<= main_~i~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8186#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:27,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {8186#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8187#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:27,317 INFO L273 TraceCheckUtils]: 30: Hoare triple {8187#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8187#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:27,317 INFO L273 TraceCheckUtils]: 31: Hoare triple {8187#(<= main_~i~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8187#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:27,317 INFO L273 TraceCheckUtils]: 32: Hoare triple {8187#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8188#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:27,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {8188#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8188#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:27,318 INFO L273 TraceCheckUtils]: 34: Hoare triple {8188#(<= main_~i~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8188#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:27,319 INFO L273 TraceCheckUtils]: 35: Hoare triple {8188#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8189#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:27,320 INFO L273 TraceCheckUtils]: 36: Hoare triple {8189#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8189#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:27,320 INFO L273 TraceCheckUtils]: 37: Hoare triple {8189#(<= main_~i~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8189#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:27,321 INFO L273 TraceCheckUtils]: 38: Hoare triple {8189#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8190#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:27,321 INFO L273 TraceCheckUtils]: 39: Hoare triple {8190#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8190#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:27,322 INFO L273 TraceCheckUtils]: 40: Hoare triple {8190#(<= main_~i~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8190#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:27,323 INFO L273 TraceCheckUtils]: 41: Hoare triple {8190#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8191#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:27,323 INFO L273 TraceCheckUtils]: 42: Hoare triple {8191#(<= main_~i~0 12)} assume !(~i~0 < 100000); {8178#false} is VALID [2018-11-23 11:56:27,324 INFO L273 TraceCheckUtils]: 43: Hoare triple {8178#false} ~f~0 := 1;~i~0 := 0; {8178#false} is VALID [2018-11-23 11:56:27,324 INFO L273 TraceCheckUtils]: 44: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:27,324 INFO L273 TraceCheckUtils]: 45: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:27,324 INFO L273 TraceCheckUtils]: 46: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:27,324 INFO L273 TraceCheckUtils]: 47: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:27,325 INFO L273 TraceCheckUtils]: 48: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:27,325 INFO L273 TraceCheckUtils]: 49: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:27,325 INFO L273 TraceCheckUtils]: 50: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:27,325 INFO L273 TraceCheckUtils]: 51: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:27,325 INFO L273 TraceCheckUtils]: 52: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:27,326 INFO L273 TraceCheckUtils]: 53: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:27,326 INFO L273 TraceCheckUtils]: 54: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:27,326 INFO L273 TraceCheckUtils]: 55: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:27,326 INFO L273 TraceCheckUtils]: 56: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:27,326 INFO L273 TraceCheckUtils]: 57: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:27,327 INFO L273 TraceCheckUtils]: 58: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:27,327 INFO L273 TraceCheckUtils]: 59: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:27,327 INFO L273 TraceCheckUtils]: 60: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:27,327 INFO L273 TraceCheckUtils]: 61: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:27,328 INFO L273 TraceCheckUtils]: 62: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:27,328 INFO L273 TraceCheckUtils]: 63: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:27,328 INFO L273 TraceCheckUtils]: 64: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:27,328 INFO L273 TraceCheckUtils]: 65: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:27,328 INFO L273 TraceCheckUtils]: 66: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:27,328 INFO L273 TraceCheckUtils]: 67: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:27,328 INFO L273 TraceCheckUtils]: 68: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:27,329 INFO L273 TraceCheckUtils]: 69: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:27,329 INFO L273 TraceCheckUtils]: 70: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:27,329 INFO L273 TraceCheckUtils]: 71: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:27,329 INFO L273 TraceCheckUtils]: 72: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:27,329 INFO L273 TraceCheckUtils]: 73: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:27,329 INFO L273 TraceCheckUtils]: 74: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:27,329 INFO L273 TraceCheckUtils]: 75: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:27,329 INFO L273 TraceCheckUtils]: 76: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:27,330 INFO L273 TraceCheckUtils]: 77: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:27,330 INFO L273 TraceCheckUtils]: 78: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:27,330 INFO L273 TraceCheckUtils]: 79: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:27,330 INFO L273 TraceCheckUtils]: 80: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:27,330 INFO L273 TraceCheckUtils]: 81: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:27,330 INFO L273 TraceCheckUtils]: 82: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:27,330 INFO L273 TraceCheckUtils]: 83: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:27,330 INFO L273 TraceCheckUtils]: 84: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:27,330 INFO L273 TraceCheckUtils]: 85: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:27,331 INFO L273 TraceCheckUtils]: 86: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:27,331 INFO L273 TraceCheckUtils]: 87: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:27,331 INFO L273 TraceCheckUtils]: 88: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:27,331 INFO L273 TraceCheckUtils]: 89: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:27,331 INFO L273 TraceCheckUtils]: 90: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:27,331 INFO L273 TraceCheckUtils]: 91: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:27,331 INFO L273 TraceCheckUtils]: 92: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:27,331 INFO L273 TraceCheckUtils]: 93: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:27,331 INFO L273 TraceCheckUtils]: 94: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:27,332 INFO L273 TraceCheckUtils]: 95: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:27,332 INFO L273 TraceCheckUtils]: 96: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:27,332 INFO L273 TraceCheckUtils]: 97: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:27,332 INFO L273 TraceCheckUtils]: 98: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:27,332 INFO L273 TraceCheckUtils]: 99: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:27,332 INFO L273 TraceCheckUtils]: 100: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:27,332 INFO L273 TraceCheckUtils]: 101: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:27,332 INFO L273 TraceCheckUtils]: 102: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:27,333 INFO L273 TraceCheckUtils]: 103: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:27,333 INFO L273 TraceCheckUtils]: 104: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:27,333 INFO L273 TraceCheckUtils]: 105: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:27,333 INFO L273 TraceCheckUtils]: 106: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:27,333 INFO L273 TraceCheckUtils]: 107: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:27,333 INFO L273 TraceCheckUtils]: 108: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:27,333 INFO L273 TraceCheckUtils]: 109: Hoare triple {8178#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {8178#false} is VALID [2018-11-23 11:56:27,333 INFO L273 TraceCheckUtils]: 110: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:27,333 INFO L273 TraceCheckUtils]: 111: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:27,334 INFO L273 TraceCheckUtils]: 112: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:27,334 INFO L273 TraceCheckUtils]: 113: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:27,334 INFO L273 TraceCheckUtils]: 114: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:27,334 INFO L273 TraceCheckUtils]: 115: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:27,334 INFO L273 TraceCheckUtils]: 116: Hoare triple {8178#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {8178#false} is VALID [2018-11-23 11:56:27,334 INFO L273 TraceCheckUtils]: 117: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:27,334 INFO L273 TraceCheckUtils]: 118: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:27,334 INFO L273 TraceCheckUtils]: 119: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:27,335 INFO L273 TraceCheckUtils]: 120: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:27,335 INFO L273 TraceCheckUtils]: 121: Hoare triple {8178#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {8178#false} is VALID [2018-11-23 11:56:27,335 INFO L273 TraceCheckUtils]: 122: Hoare triple {8178#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {8178#false} is VALID [2018-11-23 11:56:27,335 INFO L273 TraceCheckUtils]: 123: Hoare triple {8178#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {8178#false} is VALID [2018-11-23 11:56:27,335 INFO L273 TraceCheckUtils]: 124: Hoare triple {8178#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {8178#false} is VALID [2018-11-23 11:56:27,335 INFO L273 TraceCheckUtils]: 125: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 11:56:27,335 INFO L273 TraceCheckUtils]: 126: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {8178#false} is VALID [2018-11-23 11:56:27,335 INFO L273 TraceCheckUtils]: 127: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 11:56:27,335 INFO L273 TraceCheckUtils]: 128: Hoare triple {8178#false} assume !(~i~0 < 100000); {8178#false} is VALID [2018-11-23 11:56:27,336 INFO L256 TraceCheckUtils]: 129: Hoare triple {8178#false} call __VERIFIER_assert(~f~0); {8178#false} is VALID [2018-11-23 11:56:27,336 INFO L273 TraceCheckUtils]: 130: Hoare triple {8178#false} ~cond := #in~cond; {8178#false} is VALID [2018-11-23 11:56:27,336 INFO L273 TraceCheckUtils]: 131: Hoare triple {8178#false} assume 0 == ~cond; {8178#false} is VALID [2018-11-23 11:56:27,336 INFO L273 TraceCheckUtils]: 132: Hoare triple {8178#false} assume !false; {8178#false} is VALID [2018-11-23 11:56:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2018-11-23 11:56:27,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:27,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 11:56:27,364 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 133 [2018-11-23 11:56:27,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:27,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:56:27,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:27,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:56:27,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:56:27,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:56:27,429 INFO L87 Difference]: Start difference. First operand 457 states and 655 transitions. Second operand 16 states. [2018-11-23 11:56:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:29,342 INFO L93 Difference]: Finished difference Result 1093 states and 1558 transitions. [2018-11-23 11:56:29,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:56:29,342 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 133 [2018-11-23 11:56:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:56:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 242 transitions. [2018-11-23 11:56:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:56:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 242 transitions. [2018-11-23 11:56:29,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 242 transitions. [2018-11-23 11:56:30,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:30,032 INFO L225 Difference]: With dead ends: 1093 [2018-11-23 11:56:30,032 INFO L226 Difference]: Without dead ends: 686 [2018-11-23 11:56:30,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:56:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-11-23 11:56:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 493. [2018-11-23 11:56:30,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:30,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 686 states. Second operand 493 states. [2018-11-23 11:56:30,545 INFO L74 IsIncluded]: Start isIncluded. First operand 686 states. Second operand 493 states. [2018-11-23 11:56:30,545 INFO L87 Difference]: Start difference. First operand 686 states. Second operand 493 states. [2018-11-23 11:56:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:30,573 INFO L93 Difference]: Finished difference Result 686 states and 963 transitions. [2018-11-23 11:56:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 963 transitions. [2018-11-23 11:56:30,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:30,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:30,576 INFO L74 IsIncluded]: Start isIncluded. First operand 493 states. Second operand 686 states. [2018-11-23 11:56:30,576 INFO L87 Difference]: Start difference. First operand 493 states. Second operand 686 states. [2018-11-23 11:56:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:30,605 INFO L93 Difference]: Finished difference Result 686 states and 963 transitions. [2018-11-23 11:56:30,605 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 963 transitions. [2018-11-23 11:56:30,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:30,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:30,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:30,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-11-23 11:56:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 707 transitions. [2018-11-23 11:56:30,627 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 707 transitions. Word has length 133 [2018-11-23 11:56:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:30,627 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 707 transitions. [2018-11-23 11:56:30,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:56:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 707 transitions. [2018-11-23 11:56:30,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-23 11:56:30,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:30,630 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:30,630 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:30,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:30,631 INFO L82 PathProgramCache]: Analyzing trace with hash -335758675, now seen corresponding path program 5 times [2018-11-23 11:56:30,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:30,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:30,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:31,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {11737#true} call ULTIMATE.init(); {11737#true} is VALID [2018-11-23 11:56:31,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {11737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11737#true} is VALID [2018-11-23 11:56:31,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {11737#true} assume true; {11737#true} is VALID [2018-11-23 11:56:31,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11737#true} {11737#true} #79#return; {11737#true} is VALID [2018-11-23 11:56:31,212 INFO L256 TraceCheckUtils]: 4: Hoare triple {11737#true} call #t~ret7 := main(); {11737#true} is VALID [2018-11-23 11:56:31,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {11737#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11739#(= main_~i~0 0)} is VALID [2018-11-23 11:56:31,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {11739#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11739#(= main_~i~0 0)} is VALID [2018-11-23 11:56:31,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {11739#(= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11739#(= main_~i~0 0)} is VALID [2018-11-23 11:56:31,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {11739#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {11740#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,214 INFO L273 TraceCheckUtils]: 9: Hoare triple {11740#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11740#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,214 INFO L273 TraceCheckUtils]: 10: Hoare triple {11740#(<= main_~i~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11740#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {11740#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {11741#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {11741#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11741#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,216 INFO L273 TraceCheckUtils]: 13: Hoare triple {11741#(<= main_~i~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11741#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {11741#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {11742#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,217 INFO L273 TraceCheckUtils]: 15: Hoare triple {11742#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11742#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,217 INFO L273 TraceCheckUtils]: 16: Hoare triple {11742#(<= main_~i~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11742#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,218 INFO L273 TraceCheckUtils]: 17: Hoare triple {11742#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {11743#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {11743#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11743#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {11743#(<= main_~i~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11743#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {11743#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {11744#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,221 INFO L273 TraceCheckUtils]: 21: Hoare triple {11744#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11744#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,221 INFO L273 TraceCheckUtils]: 22: Hoare triple {11744#(<= main_~i~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11744#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {11744#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {11745#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {11745#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11745#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,223 INFO L273 TraceCheckUtils]: 25: Hoare triple {11745#(<= main_~i~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11745#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,224 INFO L273 TraceCheckUtils]: 26: Hoare triple {11745#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {11746#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,224 INFO L273 TraceCheckUtils]: 27: Hoare triple {11746#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11746#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {11746#(<= main_~i~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11746#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,226 INFO L273 TraceCheckUtils]: 29: Hoare triple {11746#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {11747#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {11747#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11747#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {11747#(<= main_~i~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11747#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {11747#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {11748#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {11748#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11748#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,228 INFO L273 TraceCheckUtils]: 34: Hoare triple {11748#(<= main_~i~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11748#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,229 INFO L273 TraceCheckUtils]: 35: Hoare triple {11748#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {11749#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,230 INFO L273 TraceCheckUtils]: 36: Hoare triple {11749#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11749#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,230 INFO L273 TraceCheckUtils]: 37: Hoare triple {11749#(<= main_~i~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11749#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,231 INFO L273 TraceCheckUtils]: 38: Hoare triple {11749#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {11750#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,232 INFO L273 TraceCheckUtils]: 39: Hoare triple {11750#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11750#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,232 INFO L273 TraceCheckUtils]: 40: Hoare triple {11750#(<= main_~i~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11750#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,233 INFO L273 TraceCheckUtils]: 41: Hoare triple {11750#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {11751#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,233 INFO L273 TraceCheckUtils]: 42: Hoare triple {11751#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11751#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {11751#(<= main_~i~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11751#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,235 INFO L273 TraceCheckUtils]: 44: Hoare triple {11751#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {11752#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:31,235 INFO L273 TraceCheckUtils]: 45: Hoare triple {11752#(<= main_~i~0 13)} assume !(~i~0 < 100000); {11738#false} is VALID [2018-11-23 11:56:31,236 INFO L273 TraceCheckUtils]: 46: Hoare triple {11738#false} ~f~0 := 1;~i~0 := 0; {11738#false} is VALID [2018-11-23 11:56:31,236 INFO L273 TraceCheckUtils]: 47: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,236 INFO L273 TraceCheckUtils]: 48: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,236 INFO L273 TraceCheckUtils]: 49: Hoare triple {11738#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11738#false} is VALID [2018-11-23 11:56:31,236 INFO L273 TraceCheckUtils]: 50: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,237 INFO L273 TraceCheckUtils]: 51: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,237 INFO L273 TraceCheckUtils]: 52: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,237 INFO L273 TraceCheckUtils]: 53: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,237 INFO L273 TraceCheckUtils]: 54: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,237 INFO L273 TraceCheckUtils]: 55: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,238 INFO L273 TraceCheckUtils]: 56: Hoare triple {11738#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11738#false} is VALID [2018-11-23 11:56:31,238 INFO L273 TraceCheckUtils]: 57: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,238 INFO L273 TraceCheckUtils]: 58: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,238 INFO L273 TraceCheckUtils]: 59: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,238 INFO L273 TraceCheckUtils]: 60: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,238 INFO L273 TraceCheckUtils]: 61: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,239 INFO L273 TraceCheckUtils]: 62: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,239 INFO L273 TraceCheckUtils]: 63: Hoare triple {11738#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11738#false} is VALID [2018-11-23 11:56:31,239 INFO L273 TraceCheckUtils]: 64: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,239 INFO L273 TraceCheckUtils]: 65: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,239 INFO L273 TraceCheckUtils]: 66: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,239 INFO L273 TraceCheckUtils]: 67: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,239 INFO L273 TraceCheckUtils]: 68: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,239 INFO L273 TraceCheckUtils]: 69: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,239 INFO L273 TraceCheckUtils]: 70: Hoare triple {11738#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11738#false} is VALID [2018-11-23 11:56:31,240 INFO L273 TraceCheckUtils]: 71: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,240 INFO L273 TraceCheckUtils]: 72: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,240 INFO L273 TraceCheckUtils]: 73: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,240 INFO L273 TraceCheckUtils]: 74: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,240 INFO L273 TraceCheckUtils]: 75: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,240 INFO L273 TraceCheckUtils]: 76: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,240 INFO L273 TraceCheckUtils]: 77: Hoare triple {11738#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11738#false} is VALID [2018-11-23 11:56:31,240 INFO L273 TraceCheckUtils]: 78: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,241 INFO L273 TraceCheckUtils]: 79: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,241 INFO L273 TraceCheckUtils]: 80: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,241 INFO L273 TraceCheckUtils]: 81: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,241 INFO L273 TraceCheckUtils]: 82: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,241 INFO L273 TraceCheckUtils]: 83: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,241 INFO L273 TraceCheckUtils]: 84: Hoare triple {11738#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11738#false} is VALID [2018-11-23 11:56:31,241 INFO L273 TraceCheckUtils]: 85: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,241 INFO L273 TraceCheckUtils]: 86: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,241 INFO L273 TraceCheckUtils]: 87: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,242 INFO L273 TraceCheckUtils]: 88: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,242 INFO L273 TraceCheckUtils]: 89: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,242 INFO L273 TraceCheckUtils]: 90: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,242 INFO L273 TraceCheckUtils]: 91: Hoare triple {11738#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11738#false} is VALID [2018-11-23 11:56:31,242 INFO L273 TraceCheckUtils]: 92: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,242 INFO L273 TraceCheckUtils]: 93: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,242 INFO L273 TraceCheckUtils]: 94: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,242 INFO L273 TraceCheckUtils]: 95: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,243 INFO L273 TraceCheckUtils]: 96: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,243 INFO L273 TraceCheckUtils]: 97: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,243 INFO L273 TraceCheckUtils]: 98: Hoare triple {11738#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11738#false} is VALID [2018-11-23 11:56:31,243 INFO L273 TraceCheckUtils]: 99: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,243 INFO L273 TraceCheckUtils]: 100: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,243 INFO L273 TraceCheckUtils]: 101: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,243 INFO L273 TraceCheckUtils]: 102: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,243 INFO L273 TraceCheckUtils]: 103: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,243 INFO L273 TraceCheckUtils]: 104: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,244 INFO L273 TraceCheckUtils]: 105: Hoare triple {11738#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11738#false} is VALID [2018-11-23 11:56:31,244 INFO L273 TraceCheckUtils]: 106: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,244 INFO L273 TraceCheckUtils]: 107: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,244 INFO L273 TraceCheckUtils]: 108: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,244 INFO L273 TraceCheckUtils]: 109: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,244 INFO L273 TraceCheckUtils]: 110: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,244 INFO L273 TraceCheckUtils]: 111: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,244 INFO L273 TraceCheckUtils]: 112: Hoare triple {11738#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11738#false} is VALID [2018-11-23 11:56:31,244 INFO L273 TraceCheckUtils]: 113: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,245 INFO L273 TraceCheckUtils]: 114: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,245 INFO L273 TraceCheckUtils]: 115: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,245 INFO L273 TraceCheckUtils]: 116: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,245 INFO L273 TraceCheckUtils]: 117: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,245 INFO L273 TraceCheckUtils]: 118: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,245 INFO L273 TraceCheckUtils]: 119: Hoare triple {11738#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11738#false} is VALID [2018-11-23 11:56:31,245 INFO L273 TraceCheckUtils]: 120: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,245 INFO L273 TraceCheckUtils]: 121: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,246 INFO L273 TraceCheckUtils]: 122: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,246 INFO L273 TraceCheckUtils]: 123: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,246 INFO L273 TraceCheckUtils]: 124: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,246 INFO L273 TraceCheckUtils]: 125: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,246 INFO L273 TraceCheckUtils]: 126: Hoare triple {11738#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {11738#false} is VALID [2018-11-23 11:56:31,246 INFO L273 TraceCheckUtils]: 127: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,246 INFO L273 TraceCheckUtils]: 128: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,246 INFO L273 TraceCheckUtils]: 129: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,246 INFO L273 TraceCheckUtils]: 130: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,247 INFO L273 TraceCheckUtils]: 131: Hoare triple {11738#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11738#false} is VALID [2018-11-23 11:56:31,247 INFO L273 TraceCheckUtils]: 132: Hoare triple {11738#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11738#false} is VALID [2018-11-23 11:56:31,247 INFO L273 TraceCheckUtils]: 133: Hoare triple {11738#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {11738#false} is VALID [2018-11-23 11:56:31,247 INFO L273 TraceCheckUtils]: 134: Hoare triple {11738#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11738#false} is VALID [2018-11-23 11:56:31,247 INFO L273 TraceCheckUtils]: 135: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 11:56:31,247 INFO L273 TraceCheckUtils]: 136: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11738#false} is VALID [2018-11-23 11:56:31,247 INFO L273 TraceCheckUtils]: 137: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 11:56:31,247 INFO L273 TraceCheckUtils]: 138: Hoare triple {11738#false} assume !(~i~0 < 100000); {11738#false} is VALID [2018-11-23 11:56:31,248 INFO L256 TraceCheckUtils]: 139: Hoare triple {11738#false} call __VERIFIER_assert(~f~0); {11738#false} is VALID [2018-11-23 11:56:31,248 INFO L273 TraceCheckUtils]: 140: Hoare triple {11738#false} ~cond := #in~cond; {11738#false} is VALID [2018-11-23 11:56:31,248 INFO L273 TraceCheckUtils]: 141: Hoare triple {11738#false} assume 0 == ~cond; {11738#false} is VALID [2018-11-23 11:56:31,248 INFO L273 TraceCheckUtils]: 142: Hoare triple {11738#false} assume !false; {11738#false} is VALID [2018-11-23 11:56:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2018-11-23 11:56:31,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:31,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:31,265 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:56:31,502 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-11-23 11:56:31,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:31,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:31,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {11737#true} call ULTIMATE.init(); {11737#true} is VALID [2018-11-23 11:56:31,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {11737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11737#true} is VALID [2018-11-23 11:56:31,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {11737#true} assume true; {11737#true} is VALID [2018-11-23 11:56:31,708 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11737#true} {11737#true} #79#return; {11737#true} is VALID [2018-11-23 11:56:31,709 INFO L256 TraceCheckUtils]: 4: Hoare triple {11737#true} call #t~ret7 := main(); {11737#true} is VALID [2018-11-23 11:56:31,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {11737#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11737#true} is VALID [2018-11-23 11:56:31,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,710 INFO L273 TraceCheckUtils]: 9: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,710 INFO L273 TraceCheckUtils]: 13: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,711 INFO L273 TraceCheckUtils]: 14: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,711 INFO L273 TraceCheckUtils]: 15: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,711 INFO L273 TraceCheckUtils]: 20: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,712 INFO L273 TraceCheckUtils]: 21: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,712 INFO L273 TraceCheckUtils]: 25: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,712 INFO L273 TraceCheckUtils]: 26: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,712 INFO L273 TraceCheckUtils]: 27: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,712 INFO L273 TraceCheckUtils]: 28: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,713 INFO L273 TraceCheckUtils]: 29: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,713 INFO L273 TraceCheckUtils]: 30: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,713 INFO L273 TraceCheckUtils]: 31: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,713 INFO L273 TraceCheckUtils]: 33: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,713 INFO L273 TraceCheckUtils]: 35: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,713 INFO L273 TraceCheckUtils]: 36: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,713 INFO L273 TraceCheckUtils]: 37: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,714 INFO L273 TraceCheckUtils]: 38: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,714 INFO L273 TraceCheckUtils]: 39: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,714 INFO L273 TraceCheckUtils]: 40: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,714 INFO L273 TraceCheckUtils]: 41: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,714 INFO L273 TraceCheckUtils]: 42: Hoare triple {11737#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,714 INFO L273 TraceCheckUtils]: 43: Hoare triple {11737#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {11737#true} is VALID [2018-11-23 11:56:31,714 INFO L273 TraceCheckUtils]: 44: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 11:56:31,714 INFO L273 TraceCheckUtils]: 45: Hoare triple {11737#true} assume !(~i~0 < 100000); {11737#true} is VALID [2018-11-23 11:56:31,715 INFO L273 TraceCheckUtils]: 46: Hoare triple {11737#true} ~f~0 := 1;~i~0 := 0; {11894#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:31,715 INFO L273 TraceCheckUtils]: 47: Hoare triple {11894#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11894#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:31,716 INFO L273 TraceCheckUtils]: 48: Hoare triple {11894#(<= main_~i~0 0)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11894#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:31,716 INFO L273 TraceCheckUtils]: 49: Hoare triple {11894#(<= main_~i~0 0)} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11894#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:31,716 INFO L273 TraceCheckUtils]: 50: Hoare triple {11894#(<= main_~i~0 0)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11894#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:31,716 INFO L273 TraceCheckUtils]: 51: Hoare triple {11894#(<= main_~i~0 0)} assume !#t~short6; {11894#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:31,717 INFO L273 TraceCheckUtils]: 52: Hoare triple {11894#(<= main_~i~0 0)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11894#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:31,717 INFO L273 TraceCheckUtils]: 53: Hoare triple {11894#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {11740#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {11740#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11740#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,718 INFO L273 TraceCheckUtils]: 55: Hoare triple {11740#(<= main_~i~0 1)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11740#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,718 INFO L273 TraceCheckUtils]: 56: Hoare triple {11740#(<= main_~i~0 1)} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11740#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,719 INFO L273 TraceCheckUtils]: 57: Hoare triple {11740#(<= main_~i~0 1)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11740#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,719 INFO L273 TraceCheckUtils]: 58: Hoare triple {11740#(<= main_~i~0 1)} assume !#t~short6; {11740#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,720 INFO L273 TraceCheckUtils]: 59: Hoare triple {11740#(<= main_~i~0 1)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11740#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,721 INFO L273 TraceCheckUtils]: 60: Hoare triple {11740#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {11741#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,721 INFO L273 TraceCheckUtils]: 61: Hoare triple {11741#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11741#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,722 INFO L273 TraceCheckUtils]: 62: Hoare triple {11741#(<= main_~i~0 2)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11741#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,722 INFO L273 TraceCheckUtils]: 63: Hoare triple {11741#(<= main_~i~0 2)} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11741#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,723 INFO L273 TraceCheckUtils]: 64: Hoare triple {11741#(<= main_~i~0 2)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11741#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,723 INFO L273 TraceCheckUtils]: 65: Hoare triple {11741#(<= main_~i~0 2)} assume !#t~short6; {11741#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,724 INFO L273 TraceCheckUtils]: 66: Hoare triple {11741#(<= main_~i~0 2)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11741#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,725 INFO L273 TraceCheckUtils]: 67: Hoare triple {11741#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {11742#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,725 INFO L273 TraceCheckUtils]: 68: Hoare triple {11742#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11742#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,726 INFO L273 TraceCheckUtils]: 69: Hoare triple {11742#(<= main_~i~0 3)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11742#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,726 INFO L273 TraceCheckUtils]: 70: Hoare triple {11742#(<= main_~i~0 3)} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11742#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,727 INFO L273 TraceCheckUtils]: 71: Hoare triple {11742#(<= main_~i~0 3)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11742#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,727 INFO L273 TraceCheckUtils]: 72: Hoare triple {11742#(<= main_~i~0 3)} assume !#t~short6; {11742#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,728 INFO L273 TraceCheckUtils]: 73: Hoare triple {11742#(<= main_~i~0 3)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11742#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,729 INFO L273 TraceCheckUtils]: 74: Hoare triple {11742#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {11743#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,729 INFO L273 TraceCheckUtils]: 75: Hoare triple {11743#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11743#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,730 INFO L273 TraceCheckUtils]: 76: Hoare triple {11743#(<= main_~i~0 4)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11743#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,730 INFO L273 TraceCheckUtils]: 77: Hoare triple {11743#(<= main_~i~0 4)} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11743#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,731 INFO L273 TraceCheckUtils]: 78: Hoare triple {11743#(<= main_~i~0 4)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11743#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,731 INFO L273 TraceCheckUtils]: 79: Hoare triple {11743#(<= main_~i~0 4)} assume !#t~short6; {11743#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,732 INFO L273 TraceCheckUtils]: 80: Hoare triple {11743#(<= main_~i~0 4)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11743#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,733 INFO L273 TraceCheckUtils]: 81: Hoare triple {11743#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {11744#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,733 INFO L273 TraceCheckUtils]: 82: Hoare triple {11744#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11744#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,734 INFO L273 TraceCheckUtils]: 83: Hoare triple {11744#(<= main_~i~0 5)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11744#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,734 INFO L273 TraceCheckUtils]: 84: Hoare triple {11744#(<= main_~i~0 5)} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11744#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,735 INFO L273 TraceCheckUtils]: 85: Hoare triple {11744#(<= main_~i~0 5)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11744#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,735 INFO L273 TraceCheckUtils]: 86: Hoare triple {11744#(<= main_~i~0 5)} assume !#t~short6; {11744#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,736 INFO L273 TraceCheckUtils]: 87: Hoare triple {11744#(<= main_~i~0 5)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11744#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,737 INFO L273 TraceCheckUtils]: 88: Hoare triple {11744#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {11745#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,737 INFO L273 TraceCheckUtils]: 89: Hoare triple {11745#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11745#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,738 INFO L273 TraceCheckUtils]: 90: Hoare triple {11745#(<= main_~i~0 6)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11745#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,738 INFO L273 TraceCheckUtils]: 91: Hoare triple {11745#(<= main_~i~0 6)} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11745#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,739 INFO L273 TraceCheckUtils]: 92: Hoare triple {11745#(<= main_~i~0 6)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11745#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,739 INFO L273 TraceCheckUtils]: 93: Hoare triple {11745#(<= main_~i~0 6)} assume !#t~short6; {11745#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,740 INFO L273 TraceCheckUtils]: 94: Hoare triple {11745#(<= main_~i~0 6)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11745#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,740 INFO L273 TraceCheckUtils]: 95: Hoare triple {11745#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {11746#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,741 INFO L273 TraceCheckUtils]: 96: Hoare triple {11746#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11746#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,742 INFO L273 TraceCheckUtils]: 97: Hoare triple {11746#(<= main_~i~0 7)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11746#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,742 INFO L273 TraceCheckUtils]: 98: Hoare triple {11746#(<= main_~i~0 7)} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11746#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,743 INFO L273 TraceCheckUtils]: 99: Hoare triple {11746#(<= main_~i~0 7)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11746#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,743 INFO L273 TraceCheckUtils]: 100: Hoare triple {11746#(<= main_~i~0 7)} assume !#t~short6; {11746#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,744 INFO L273 TraceCheckUtils]: 101: Hoare triple {11746#(<= main_~i~0 7)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11746#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,744 INFO L273 TraceCheckUtils]: 102: Hoare triple {11746#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {11747#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,745 INFO L273 TraceCheckUtils]: 103: Hoare triple {11747#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11747#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,745 INFO L273 TraceCheckUtils]: 104: Hoare triple {11747#(<= main_~i~0 8)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11747#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,746 INFO L273 TraceCheckUtils]: 105: Hoare triple {11747#(<= main_~i~0 8)} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11747#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,746 INFO L273 TraceCheckUtils]: 106: Hoare triple {11747#(<= main_~i~0 8)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11747#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,747 INFO L273 TraceCheckUtils]: 107: Hoare triple {11747#(<= main_~i~0 8)} assume !#t~short6; {11747#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,748 INFO L273 TraceCheckUtils]: 108: Hoare triple {11747#(<= main_~i~0 8)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11747#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,748 INFO L273 TraceCheckUtils]: 109: Hoare triple {11747#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {11748#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,749 INFO L273 TraceCheckUtils]: 110: Hoare triple {11748#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11748#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,749 INFO L273 TraceCheckUtils]: 111: Hoare triple {11748#(<= main_~i~0 9)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11748#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,750 INFO L273 TraceCheckUtils]: 112: Hoare triple {11748#(<= main_~i~0 9)} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11748#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,750 INFO L273 TraceCheckUtils]: 113: Hoare triple {11748#(<= main_~i~0 9)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11748#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,751 INFO L273 TraceCheckUtils]: 114: Hoare triple {11748#(<= main_~i~0 9)} assume !#t~short6; {11748#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,751 INFO L273 TraceCheckUtils]: 115: Hoare triple {11748#(<= main_~i~0 9)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11748#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,752 INFO L273 TraceCheckUtils]: 116: Hoare triple {11748#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {11749#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,753 INFO L273 TraceCheckUtils]: 117: Hoare triple {11749#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11749#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,753 INFO L273 TraceCheckUtils]: 118: Hoare triple {11749#(<= main_~i~0 10)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11749#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,754 INFO L273 TraceCheckUtils]: 119: Hoare triple {11749#(<= main_~i~0 10)} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {11749#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,754 INFO L273 TraceCheckUtils]: 120: Hoare triple {11749#(<= main_~i~0 10)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11749#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,755 INFO L273 TraceCheckUtils]: 121: Hoare triple {11749#(<= main_~i~0 10)} assume !#t~short6; {11749#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,755 INFO L273 TraceCheckUtils]: 122: Hoare triple {11749#(<= main_~i~0 10)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11749#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,756 INFO L273 TraceCheckUtils]: 123: Hoare triple {11749#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {11750#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,757 INFO L273 TraceCheckUtils]: 124: Hoare triple {11750#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11750#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,757 INFO L273 TraceCheckUtils]: 125: Hoare triple {11750#(<= main_~i~0 11)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11750#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,758 INFO L273 TraceCheckUtils]: 126: Hoare triple {11750#(<= main_~i~0 11)} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {11750#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,758 INFO L273 TraceCheckUtils]: 127: Hoare triple {11750#(<= main_~i~0 11)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11750#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,759 INFO L273 TraceCheckUtils]: 128: Hoare triple {11750#(<= main_~i~0 11)} assume !#t~short6; {11750#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,759 INFO L273 TraceCheckUtils]: 129: Hoare triple {11750#(<= main_~i~0 11)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11750#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,760 INFO L273 TraceCheckUtils]: 130: Hoare triple {11750#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {11751#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,761 INFO L273 TraceCheckUtils]: 131: Hoare triple {11751#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {11751#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,761 INFO L273 TraceCheckUtils]: 132: Hoare triple {11751#(<= main_~i~0 12)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {11751#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,762 INFO L273 TraceCheckUtils]: 133: Hoare triple {11751#(<= main_~i~0 12)} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {11751#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,762 INFO L273 TraceCheckUtils]: 134: Hoare triple {11751#(<= main_~i~0 12)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {11751#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,763 INFO L273 TraceCheckUtils]: 135: Hoare triple {11751#(<= main_~i~0 12)} assume !#t~short6; {11751#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,763 INFO L273 TraceCheckUtils]: 136: Hoare triple {11751#(<= main_~i~0 12)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {11751#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,775 INFO L273 TraceCheckUtils]: 137: Hoare triple {11751#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {11752#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:31,777 INFO L273 TraceCheckUtils]: 138: Hoare triple {11752#(<= main_~i~0 13)} assume !(~i~0 < 100000); {11738#false} is VALID [2018-11-23 11:56:31,777 INFO L256 TraceCheckUtils]: 139: Hoare triple {11738#false} call __VERIFIER_assert(~f~0); {11738#false} is VALID [2018-11-23 11:56:31,777 INFO L273 TraceCheckUtils]: 140: Hoare triple {11738#false} ~cond := #in~cond; {11738#false} is VALID [2018-11-23 11:56:31,777 INFO L273 TraceCheckUtils]: 141: Hoare triple {11738#false} assume 0 == ~cond; {11738#false} is VALID [2018-11-23 11:56:31,777 INFO L273 TraceCheckUtils]: 142: Hoare triple {11738#false} assume !false; {11738#false} is VALID [2018-11-23 11:56:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 0 proven. 559 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-23 11:56:31,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:31,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:56:31,810 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2018-11-23 11:56:31,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:31,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:56:31,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:31,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:56:31,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:56:31,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:56:31,967 INFO L87 Difference]: Start difference. First operand 493 states and 707 transitions. Second operand 17 states. [2018-11-23 11:56:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:33,899 INFO L93 Difference]: Finished difference Result 1162 states and 1658 transitions. [2018-11-23 11:56:33,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:56:33,900 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2018-11-23 11:56:33,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:56:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 257 transitions. [2018-11-23 11:56:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:56:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 257 transitions. [2018-11-23 11:56:33,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 257 transitions. [2018-11-23 11:56:34,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:34,694 INFO L225 Difference]: With dead ends: 1162 [2018-11-23 11:56:34,694 INFO L226 Difference]: Without dead ends: 722 [2018-11-23 11:56:34,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:56:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-11-23 11:56:35,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 529. [2018-11-23 11:56:35,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:35,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 722 states. Second operand 529 states. [2018-11-23 11:56:35,147 INFO L74 IsIncluded]: Start isIncluded. First operand 722 states. Second operand 529 states. [2018-11-23 11:56:35,147 INFO L87 Difference]: Start difference. First operand 722 states. Second operand 529 states. [2018-11-23 11:56:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:35,180 INFO L93 Difference]: Finished difference Result 722 states and 1015 transitions. [2018-11-23 11:56:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1015 transitions. [2018-11-23 11:56:35,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:35,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:35,182 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand 722 states. [2018-11-23 11:56:35,183 INFO L87 Difference]: Start difference. First operand 529 states. Second operand 722 states. [2018-11-23 11:56:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:35,216 INFO L93 Difference]: Finished difference Result 722 states and 1015 transitions. [2018-11-23 11:56:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1015 transitions. [2018-11-23 11:56:35,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:35,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:35,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:35,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-23 11:56:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 759 transitions. [2018-11-23 11:56:35,241 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 759 transitions. Word has length 143 [2018-11-23 11:56:35,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:35,241 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 759 transitions. [2018-11-23 11:56:35,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:56:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 759 transitions. [2018-11-23 11:56:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-23 11:56:35,244 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:35,244 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:35,244 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:35,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:35,245 INFO L82 PathProgramCache]: Analyzing trace with hash 940765616, now seen corresponding path program 6 times [2018-11-23 11:56:35,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:35,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:35,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:35,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:35,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:36,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {15516#true} call ULTIMATE.init(); {15516#true} is VALID [2018-11-23 11:56:36,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {15516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15516#true} is VALID [2018-11-23 11:56:36,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {15516#true} assume true; {15516#true} is VALID [2018-11-23 11:56:36,075 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15516#true} {15516#true} #79#return; {15516#true} is VALID [2018-11-23 11:56:36,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {15516#true} call #t~ret7 := main(); {15516#true} is VALID [2018-11-23 11:56:36,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {15516#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15518#(= main_~i~0 0)} is VALID [2018-11-23 11:56:36,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {15518#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15518#(= main_~i~0 0)} is VALID [2018-11-23 11:56:36,076 INFO L273 TraceCheckUtils]: 7: Hoare triple {15518#(= main_~i~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15518#(= main_~i~0 0)} is VALID [2018-11-23 11:56:36,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {15518#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {15519#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:36,077 INFO L273 TraceCheckUtils]: 9: Hoare triple {15519#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15519#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:36,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {15519#(<= main_~i~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15519#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:36,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {15519#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {15520#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:36,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {15520#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15520#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:36,079 INFO L273 TraceCheckUtils]: 13: Hoare triple {15520#(<= main_~i~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15520#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:36,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {15520#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {15521#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:36,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {15521#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15521#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:36,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {15521#(<= main_~i~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15521#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:36,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {15521#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {15522#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:36,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {15522#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15522#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:36,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {15522#(<= main_~i~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15522#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:36,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {15522#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {15523#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:36,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {15523#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15523#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:36,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {15523#(<= main_~i~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15523#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:36,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {15523#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {15524#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:36,085 INFO L273 TraceCheckUtils]: 24: Hoare triple {15524#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15524#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:36,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {15524#(<= main_~i~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15524#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:36,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {15524#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {15525#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:36,087 INFO L273 TraceCheckUtils]: 27: Hoare triple {15525#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15525#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:36,088 INFO L273 TraceCheckUtils]: 28: Hoare triple {15525#(<= main_~i~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15525#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:36,088 INFO L273 TraceCheckUtils]: 29: Hoare triple {15525#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {15526#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:36,089 INFO L273 TraceCheckUtils]: 30: Hoare triple {15526#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15526#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:36,090 INFO L273 TraceCheckUtils]: 31: Hoare triple {15526#(<= main_~i~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15526#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:36,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {15526#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {15527#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:36,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {15527#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15527#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:36,091 INFO L273 TraceCheckUtils]: 34: Hoare triple {15527#(<= main_~i~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15527#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:36,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {15527#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {15528#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:36,093 INFO L273 TraceCheckUtils]: 36: Hoare triple {15528#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15528#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:36,093 INFO L273 TraceCheckUtils]: 37: Hoare triple {15528#(<= main_~i~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15528#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:36,094 INFO L273 TraceCheckUtils]: 38: Hoare triple {15528#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {15529#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:36,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {15529#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15529#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:36,095 INFO L273 TraceCheckUtils]: 40: Hoare triple {15529#(<= main_~i~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15529#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:36,096 INFO L273 TraceCheckUtils]: 41: Hoare triple {15529#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {15530#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:36,096 INFO L273 TraceCheckUtils]: 42: Hoare triple {15530#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15530#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:36,097 INFO L273 TraceCheckUtils]: 43: Hoare triple {15530#(<= main_~i~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15530#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:36,098 INFO L273 TraceCheckUtils]: 44: Hoare triple {15530#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {15531#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:36,098 INFO L273 TraceCheckUtils]: 45: Hoare triple {15531#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15531#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:36,099 INFO L273 TraceCheckUtils]: 46: Hoare triple {15531#(<= main_~i~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15531#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:36,119 INFO L273 TraceCheckUtils]: 47: Hoare triple {15531#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {15532#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:36,119 INFO L273 TraceCheckUtils]: 48: Hoare triple {15532#(<= main_~i~0 14)} assume !(~i~0 < 100000); {15517#false} is VALID [2018-11-23 11:56:36,120 INFO L273 TraceCheckUtils]: 49: Hoare triple {15517#false} ~f~0 := 1;~i~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,120 INFO L273 TraceCheckUtils]: 50: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,120 INFO L273 TraceCheckUtils]: 51: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,120 INFO L273 TraceCheckUtils]: 52: Hoare triple {15517#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,120 INFO L273 TraceCheckUtils]: 53: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,120 INFO L273 TraceCheckUtils]: 54: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,120 INFO L273 TraceCheckUtils]: 55: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,121 INFO L273 TraceCheckUtils]: 56: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,121 INFO L273 TraceCheckUtils]: 57: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,121 INFO L273 TraceCheckUtils]: 58: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,121 INFO L273 TraceCheckUtils]: 59: Hoare triple {15517#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,121 INFO L273 TraceCheckUtils]: 60: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,121 INFO L273 TraceCheckUtils]: 61: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,121 INFO L273 TraceCheckUtils]: 62: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,121 INFO L273 TraceCheckUtils]: 63: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,121 INFO L273 TraceCheckUtils]: 64: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,122 INFO L273 TraceCheckUtils]: 65: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,122 INFO L273 TraceCheckUtils]: 66: Hoare triple {15517#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,122 INFO L273 TraceCheckUtils]: 67: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,122 INFO L273 TraceCheckUtils]: 68: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,122 INFO L273 TraceCheckUtils]: 69: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,122 INFO L273 TraceCheckUtils]: 70: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,122 INFO L273 TraceCheckUtils]: 71: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,122 INFO L273 TraceCheckUtils]: 72: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,122 INFO L273 TraceCheckUtils]: 73: Hoare triple {15517#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,123 INFO L273 TraceCheckUtils]: 74: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,123 INFO L273 TraceCheckUtils]: 75: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,123 INFO L273 TraceCheckUtils]: 76: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,123 INFO L273 TraceCheckUtils]: 77: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,123 INFO L273 TraceCheckUtils]: 78: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,123 INFO L273 TraceCheckUtils]: 79: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,123 INFO L273 TraceCheckUtils]: 80: Hoare triple {15517#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,123 INFO L273 TraceCheckUtils]: 81: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,124 INFO L273 TraceCheckUtils]: 82: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,124 INFO L273 TraceCheckUtils]: 83: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,124 INFO L273 TraceCheckUtils]: 84: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,124 INFO L273 TraceCheckUtils]: 85: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,124 INFO L273 TraceCheckUtils]: 86: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,124 INFO L273 TraceCheckUtils]: 87: Hoare triple {15517#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,124 INFO L273 TraceCheckUtils]: 88: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,124 INFO L273 TraceCheckUtils]: 89: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,124 INFO L273 TraceCheckUtils]: 90: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,125 INFO L273 TraceCheckUtils]: 91: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,125 INFO L273 TraceCheckUtils]: 92: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,125 INFO L273 TraceCheckUtils]: 93: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,125 INFO L273 TraceCheckUtils]: 94: Hoare triple {15517#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,125 INFO L273 TraceCheckUtils]: 95: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,125 INFO L273 TraceCheckUtils]: 96: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,125 INFO L273 TraceCheckUtils]: 97: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,125 INFO L273 TraceCheckUtils]: 98: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,126 INFO L273 TraceCheckUtils]: 99: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,126 INFO L273 TraceCheckUtils]: 100: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,126 INFO L273 TraceCheckUtils]: 101: Hoare triple {15517#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,126 INFO L273 TraceCheckUtils]: 102: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,126 INFO L273 TraceCheckUtils]: 103: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,126 INFO L273 TraceCheckUtils]: 104: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,126 INFO L273 TraceCheckUtils]: 105: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,126 INFO L273 TraceCheckUtils]: 106: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,126 INFO L273 TraceCheckUtils]: 107: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,127 INFO L273 TraceCheckUtils]: 108: Hoare triple {15517#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,127 INFO L273 TraceCheckUtils]: 109: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,127 INFO L273 TraceCheckUtils]: 110: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,127 INFO L273 TraceCheckUtils]: 111: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,127 INFO L273 TraceCheckUtils]: 112: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,127 INFO L273 TraceCheckUtils]: 113: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,127 INFO L273 TraceCheckUtils]: 114: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,127 INFO L273 TraceCheckUtils]: 115: Hoare triple {15517#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,127 INFO L273 TraceCheckUtils]: 116: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,128 INFO L273 TraceCheckUtils]: 117: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,128 INFO L273 TraceCheckUtils]: 118: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,128 INFO L273 TraceCheckUtils]: 119: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,128 INFO L273 TraceCheckUtils]: 120: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,128 INFO L273 TraceCheckUtils]: 121: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,128 INFO L273 TraceCheckUtils]: 122: Hoare triple {15517#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,128 INFO L273 TraceCheckUtils]: 123: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,128 INFO L273 TraceCheckUtils]: 124: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,129 INFO L273 TraceCheckUtils]: 125: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,129 INFO L273 TraceCheckUtils]: 126: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,129 INFO L273 TraceCheckUtils]: 127: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,129 INFO L273 TraceCheckUtils]: 128: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,129 INFO L273 TraceCheckUtils]: 129: Hoare triple {15517#false} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15517#false} is VALID [2018-11-23 11:56:36,129 INFO L273 TraceCheckUtils]: 130: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,129 INFO L273 TraceCheckUtils]: 131: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,129 INFO L273 TraceCheckUtils]: 132: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,129 INFO L273 TraceCheckUtils]: 133: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,130 INFO L273 TraceCheckUtils]: 134: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,130 INFO L273 TraceCheckUtils]: 135: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,130 INFO L273 TraceCheckUtils]: 136: Hoare triple {15517#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {15517#false} is VALID [2018-11-23 11:56:36,130 INFO L273 TraceCheckUtils]: 137: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,130 INFO L273 TraceCheckUtils]: 138: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,130 INFO L273 TraceCheckUtils]: 139: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,130 INFO L273 TraceCheckUtils]: 140: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,130 INFO L273 TraceCheckUtils]: 141: Hoare triple {15517#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15517#false} is VALID [2018-11-23 11:56:36,131 INFO L273 TraceCheckUtils]: 142: Hoare triple {15517#false} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15517#false} is VALID [2018-11-23 11:56:36,131 INFO L273 TraceCheckUtils]: 143: Hoare triple {15517#false} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {15517#false} is VALID [2018-11-23 11:56:36,131 INFO L273 TraceCheckUtils]: 144: Hoare triple {15517#false} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15517#false} is VALID [2018-11-23 11:56:36,131 INFO L273 TraceCheckUtils]: 145: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 11:56:36,131 INFO L273 TraceCheckUtils]: 146: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15517#false} is VALID [2018-11-23 11:56:36,131 INFO L273 TraceCheckUtils]: 147: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 11:56:36,131 INFO L273 TraceCheckUtils]: 148: Hoare triple {15517#false} assume !(~i~0 < 100000); {15517#false} is VALID [2018-11-23 11:56:36,131 INFO L256 TraceCheckUtils]: 149: Hoare triple {15517#false} call __VERIFIER_assert(~f~0); {15517#false} is VALID [2018-11-23 11:56:36,131 INFO L273 TraceCheckUtils]: 150: Hoare triple {15517#false} ~cond := #in~cond; {15517#false} is VALID [2018-11-23 11:56:36,132 INFO L273 TraceCheckUtils]: 151: Hoare triple {15517#false} assume 0 == ~cond; {15517#false} is VALID [2018-11-23 11:56:36,132 INFO L273 TraceCheckUtils]: 152: Hoare triple {15517#false} assume !false; {15517#false} is VALID [2018-11-23 11:56:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-11-23 11:56:36,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:36,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:36,151 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:56:36,215 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 11:56:36,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:36,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:36,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 11:56:36,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 11:56:36,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:56:36,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:56:36,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:56:36,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:56:36,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-23 11:56:36,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:36,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-23 11:56:36,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:56:36,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:56:36,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:56:36,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 11:56:36,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 11:56:36,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:36,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:36,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:36,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2018-11-23 11:56:36,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:56:36,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:56:36,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:56:36,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2018-11-23 11:56:41,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-11-23 11:56:41,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:41,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:41,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:41,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:41,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:41,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:41,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:41,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-11-23 11:56:41,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:56:41,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:56:41,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-11-23 11:56:41,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:41,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:41,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:56:41,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 95 [2018-11-23 11:56:41,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 11:56:41,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:56:41,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:56:41,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:111, output treesize:26 [2018-11-23 11:56:41,210 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:56:41,210 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#b~0.base|, |main_~#b~0.offset|, v_main_~i~0_65, v_prenex_12, v_prenex_9, v_prenex_10, v_prenex_11]. (let ((.cse2 (* 4 main_~i~0))) (or (let ((.cse0 (select |#memory_int| |main_~#b~0.base|)) (.cse1 (* 4 v_main_~i~0_65))) (and (< v_main_~i~0_65 100000) (= (select .cse0 (+ |main_~#b~0.offset| .cse1)) 1) (<= 99999 v_main_~i~0_65) (= (select .cse0 (+ |main_~#b~0.offset| .cse1 (- 4))) 1) (not (= 0 (select .cse0 (+ .cse2 |main_~#b~0.offset|)))) (= (select .cse0 (+ |main_~#b~0.offset| .cse1 (- 8))) 1) (not |main_#t~short3|))) (let ((.cse4 (* 4 v_prenex_11)) (.cse3 (select v_prenex_12 v_prenex_9))) (and (<= 99999 v_prenex_11) (= (select .cse3 (+ v_prenex_10 .cse4 (- 4))) 1) (= (select .cse3 (+ v_prenex_10 .cse4 (- 8))) 1) (= (select .cse3 (+ v_prenex_10 .cse4)) 1) (= 0 (select .cse3 (+ .cse2 v_prenex_10))) |main_#t~short3| (< v_prenex_11 100000))))) [2018-11-23 11:56:41,210 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (or (and (or (and (<= main_~i~0 99998) (<= main_~i~0 99997) (<= main_~i~0 99996)) (and (<= 99999 main_~i~0) (<= 100000 main_~i~0) (<= 99998 main_~i~0))) |main_#t~short3|) (not |main_#t~short3|)) [2018-11-23 11:56:41,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {15516#true} call ULTIMATE.init(); {15516#true} is VALID [2018-11-23 11:56:41,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {15516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15516#true} is VALID [2018-11-23 11:56:41,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {15516#true} assume true; {15516#true} is VALID [2018-11-23 11:56:41,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15516#true} {15516#true} #79#return; {15516#true} is VALID [2018-11-23 11:56:41,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {15516#true} call #t~ret7 := main(); {15516#true} is VALID [2018-11-23 11:56:41,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {15516#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15516#true} is VALID [2018-11-23 11:56:41,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {15516#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {15516#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 11:56:41,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {15516#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {15516#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 11:56:41,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {15516#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,436 INFO L273 TraceCheckUtils]: 13: Hoare triple {15516#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 11:56:41,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {15516#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {15516#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 11:56:41,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {15516#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {15516#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,437 INFO L273 TraceCheckUtils]: 20: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 11:56:41,437 INFO L273 TraceCheckUtils]: 21: Hoare triple {15516#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,437 INFO L273 TraceCheckUtils]: 22: Hoare triple {15516#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,437 INFO L273 TraceCheckUtils]: 23: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 11:56:41,438 INFO L273 TraceCheckUtils]: 24: Hoare triple {15516#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,438 INFO L273 TraceCheckUtils]: 25: Hoare triple {15516#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,438 INFO L273 TraceCheckUtils]: 26: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 11:56:41,438 INFO L273 TraceCheckUtils]: 27: Hoare triple {15516#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,438 INFO L273 TraceCheckUtils]: 28: Hoare triple {15516#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,438 INFO L273 TraceCheckUtils]: 29: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 11:56:41,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {15516#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,439 INFO L273 TraceCheckUtils]: 31: Hoare triple {15516#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,439 INFO L273 TraceCheckUtils]: 32: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 11:56:41,439 INFO L273 TraceCheckUtils]: 33: Hoare triple {15516#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {15516#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,439 INFO L273 TraceCheckUtils]: 35: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 11:56:41,439 INFO L273 TraceCheckUtils]: 36: Hoare triple {15516#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,440 INFO L273 TraceCheckUtils]: 37: Hoare triple {15516#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,440 INFO L273 TraceCheckUtils]: 38: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 11:56:41,440 INFO L273 TraceCheckUtils]: 39: Hoare triple {15516#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15516#true} is VALID [2018-11-23 11:56:41,440 INFO L273 TraceCheckUtils]: 40: Hoare triple {15516#true} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15656#(= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|)))} is VALID [2018-11-23 11:56:41,441 INFO L273 TraceCheckUtils]: 41: Hoare triple {15656#(= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|)))} ~i~0 := 1 + ~i~0; {15660#(= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1)} is VALID [2018-11-23 11:56:41,441 INFO L273 TraceCheckUtils]: 42: Hoare triple {15660#(= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15660#(= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1)} is VALID [2018-11-23 11:56:41,442 INFO L273 TraceCheckUtils]: 43: Hoare triple {15660#(= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1)} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15667#(and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1))} is VALID [2018-11-23 11:56:41,443 INFO L273 TraceCheckUtils]: 44: Hoare triple {15667#(and (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1))} ~i~0 := 1 + ~i~0; {15671#(and (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 8))) 1))} is VALID [2018-11-23 11:56:41,444 INFO L273 TraceCheckUtils]: 45: Hoare triple {15671#(and (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 8))) 1))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15675#(and (< main_~i~0 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 8))) 1))} is VALID [2018-11-23 11:56:41,445 INFO L273 TraceCheckUtils]: 46: Hoare triple {15675#(and (< main_~i~0 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 8))) 1))} assume #t~mem0 >= 0;havoc #t~mem0;call write~int(1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {15679#(and (< main_~i~0 100000) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 8))) 1))} is VALID [2018-11-23 11:56:41,448 INFO L273 TraceCheckUtils]: 47: Hoare triple {15679#(and (< main_~i~0 100000) (= 1 (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset| (- 8))) 1))} ~i~0 := 1 + ~i~0; {15683#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (<= main_~i~0 (+ v_main_~i~0_65 1)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,450 INFO L273 TraceCheckUtils]: 48: Hoare triple {15683#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (<= main_~i~0 (+ v_main_~i~0_65 1)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !(~i~0 < 100000); {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,451 INFO L273 TraceCheckUtils]: 49: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} ~f~0 := 1;~i~0 := 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,451 INFO L273 TraceCheckUtils]: 50: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,452 INFO L273 TraceCheckUtils]: 51: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,453 INFO L273 TraceCheckUtils]: 52: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,453 INFO L273 TraceCheckUtils]: 53: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,454 INFO L273 TraceCheckUtils]: 54: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,454 INFO L273 TraceCheckUtils]: 55: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,455 INFO L273 TraceCheckUtils]: 56: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} ~i~0 := 1 + ~i~0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,456 INFO L273 TraceCheckUtils]: 57: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,456 INFO L273 TraceCheckUtils]: 58: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,457 INFO L273 TraceCheckUtils]: 59: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,457 INFO L273 TraceCheckUtils]: 60: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,458 INFO L273 TraceCheckUtils]: 61: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,458 INFO L273 TraceCheckUtils]: 62: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,459 INFO L273 TraceCheckUtils]: 63: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} ~i~0 := 1 + ~i~0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,460 INFO L273 TraceCheckUtils]: 64: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,460 INFO L273 TraceCheckUtils]: 65: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,461 INFO L273 TraceCheckUtils]: 66: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,461 INFO L273 TraceCheckUtils]: 67: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,462 INFO L273 TraceCheckUtils]: 68: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,462 INFO L273 TraceCheckUtils]: 69: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,463 INFO L273 TraceCheckUtils]: 70: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} ~i~0 := 1 + ~i~0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,464 INFO L273 TraceCheckUtils]: 71: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,464 INFO L273 TraceCheckUtils]: 72: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,465 INFO L273 TraceCheckUtils]: 73: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,490 INFO L273 TraceCheckUtils]: 74: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,493 INFO L273 TraceCheckUtils]: 75: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,494 INFO L273 TraceCheckUtils]: 76: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,494 INFO L273 TraceCheckUtils]: 77: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} ~i~0 := 1 + ~i~0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,495 INFO L273 TraceCheckUtils]: 78: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,495 INFO L273 TraceCheckUtils]: 79: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,496 INFO L273 TraceCheckUtils]: 80: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,496 INFO L273 TraceCheckUtils]: 81: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,496 INFO L273 TraceCheckUtils]: 82: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,497 INFO L273 TraceCheckUtils]: 83: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,497 INFO L273 TraceCheckUtils]: 84: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} ~i~0 := 1 + ~i~0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,497 INFO L273 TraceCheckUtils]: 85: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,498 INFO L273 TraceCheckUtils]: 86: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,498 INFO L273 TraceCheckUtils]: 87: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,499 INFO L273 TraceCheckUtils]: 88: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,500 INFO L273 TraceCheckUtils]: 89: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,500 INFO L273 TraceCheckUtils]: 90: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,501 INFO L273 TraceCheckUtils]: 91: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} ~i~0 := 1 + ~i~0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,501 INFO L273 TraceCheckUtils]: 92: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,502 INFO L273 TraceCheckUtils]: 93: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,503 INFO L273 TraceCheckUtils]: 94: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,503 INFO L273 TraceCheckUtils]: 95: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,504 INFO L273 TraceCheckUtils]: 96: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,504 INFO L273 TraceCheckUtils]: 97: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,505 INFO L273 TraceCheckUtils]: 98: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} ~i~0 := 1 + ~i~0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,505 INFO L273 TraceCheckUtils]: 99: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,506 INFO L273 TraceCheckUtils]: 100: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,507 INFO L273 TraceCheckUtils]: 101: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,507 INFO L273 TraceCheckUtils]: 102: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,508 INFO L273 TraceCheckUtils]: 103: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,508 INFO L273 TraceCheckUtils]: 104: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,509 INFO L273 TraceCheckUtils]: 105: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} ~i~0 := 1 + ~i~0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,509 INFO L273 TraceCheckUtils]: 106: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,510 INFO L273 TraceCheckUtils]: 107: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,511 INFO L273 TraceCheckUtils]: 108: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,511 INFO L273 TraceCheckUtils]: 109: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,512 INFO L273 TraceCheckUtils]: 110: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,512 INFO L273 TraceCheckUtils]: 111: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,513 INFO L273 TraceCheckUtils]: 112: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} ~i~0 := 1 + ~i~0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,513 INFO L273 TraceCheckUtils]: 113: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,514 INFO L273 TraceCheckUtils]: 114: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,515 INFO L273 TraceCheckUtils]: 115: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,515 INFO L273 TraceCheckUtils]: 116: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,516 INFO L273 TraceCheckUtils]: 117: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,516 INFO L273 TraceCheckUtils]: 118: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,517 INFO L273 TraceCheckUtils]: 119: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} ~i~0 := 1 + ~i~0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,517 INFO L273 TraceCheckUtils]: 120: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,518 INFO L273 TraceCheckUtils]: 121: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,519 INFO L273 TraceCheckUtils]: 122: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,519 INFO L273 TraceCheckUtils]: 123: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,520 INFO L273 TraceCheckUtils]: 124: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,520 INFO L273 TraceCheckUtils]: 125: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,521 INFO L273 TraceCheckUtils]: 126: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} ~i~0 := 1 + ~i~0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,521 INFO L273 TraceCheckUtils]: 127: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} is VALID [2018-11-23 11:56:41,524 INFO L273 TraceCheckUtils]: 128: Hoare triple {15687#(exists ((v_main_~i~0_65 Int)) (and (< v_main_~i~0_65 100000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65))) 1) (<= 99999 v_main_~i~0_65) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 4))) 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 v_main_~i~0_65) (- 8))) 1)))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15928#(or (<= 100000 main_~i~0) (not |main_#t~short3|) (<= main_~i~0 99996))} is VALID [2018-11-23 11:56:41,524 INFO L273 TraceCheckUtils]: 129: Hoare triple {15928#(or (<= 100000 main_~i~0) (not |main_#t~short3|) (<= main_~i~0 99996))} assume #t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3;~f~0 := 0; {15932#(or (<= 100000 main_~i~0) (<= main_~i~0 99996))} is VALID [2018-11-23 11:56:41,525 INFO L273 TraceCheckUtils]: 130: Hoare triple {15932#(or (<= 100000 main_~i~0) (<= main_~i~0 99996))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15932#(or (<= 100000 main_~i~0) (<= main_~i~0 99996))} is VALID [2018-11-23 11:56:41,525 INFO L273 TraceCheckUtils]: 131: Hoare triple {15932#(or (<= 100000 main_~i~0) (<= main_~i~0 99996))} assume !#t~short6; {15932#(or (<= 100000 main_~i~0) (<= main_~i~0 99996))} is VALID [2018-11-23 11:56:41,526 INFO L273 TraceCheckUtils]: 132: Hoare triple {15932#(or (<= 100000 main_~i~0) (<= main_~i~0 99996))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15932#(or (<= 100000 main_~i~0) (<= main_~i~0 99996))} is VALID [2018-11-23 11:56:41,526 INFO L273 TraceCheckUtils]: 133: Hoare triple {15932#(or (<= 100000 main_~i~0) (<= main_~i~0 99996))} ~i~0 := 1 + ~i~0; {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} is VALID [2018-11-23 11:56:41,527 INFO L273 TraceCheckUtils]: 134: Hoare triple {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} is VALID [2018-11-23 11:56:41,527 INFO L273 TraceCheckUtils]: 135: Hoare triple {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} is VALID [2018-11-23 11:56:41,527 INFO L273 TraceCheckUtils]: 136: Hoare triple {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} is VALID [2018-11-23 11:56:41,528 INFO L273 TraceCheckUtils]: 137: Hoare triple {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} is VALID [2018-11-23 11:56:41,528 INFO L273 TraceCheckUtils]: 138: Hoare triple {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} assume !#t~short6; {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} is VALID [2018-11-23 11:56:41,529 INFO L273 TraceCheckUtils]: 139: Hoare triple {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} is VALID [2018-11-23 11:56:41,530 INFO L273 TraceCheckUtils]: 140: Hoare triple {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} ~i~0 := 1 + ~i~0; {15967#(or (<= 100002 main_~i~0) (<= main_~i~0 99998))} is VALID [2018-11-23 11:56:41,531 INFO L273 TraceCheckUtils]: 141: Hoare triple {15967#(or (<= 100002 main_~i~0) (<= main_~i~0 99998))} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short3 := #t~mem1 >= 0; {15971#(<= main_~i~0 99998)} is VALID [2018-11-23 11:56:41,531 INFO L273 TraceCheckUtils]: 142: Hoare triple {15971#(<= main_~i~0 99998)} assume #t~short3;call #t~mem2 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short3 := 0 == #t~mem2; {15971#(<= main_~i~0 99998)} is VALID [2018-11-23 11:56:41,532 INFO L273 TraceCheckUtils]: 143: Hoare triple {15971#(<= main_~i~0 99998)} assume !#t~short3;havoc #t~mem2;havoc #t~mem1;havoc #t~short3; {15971#(<= main_~i~0 99998)} is VALID [2018-11-23 11:56:41,532 INFO L273 TraceCheckUtils]: 144: Hoare triple {15971#(<= main_~i~0 99998)} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short6 := #t~mem4 < 0; {15971#(<= main_~i~0 99998)} is VALID [2018-11-23 11:56:41,533 INFO L273 TraceCheckUtils]: 145: Hoare triple {15971#(<= main_~i~0 99998)} assume !#t~short6; {15971#(<= main_~i~0 99998)} is VALID [2018-11-23 11:56:41,533 INFO L273 TraceCheckUtils]: 146: Hoare triple {15971#(<= main_~i~0 99998)} assume !#t~short6;havoc #t~mem4;havoc #t~short6;havoc #t~mem5; {15971#(<= main_~i~0 99998)} is VALID [2018-11-23 11:56:41,534 INFO L273 TraceCheckUtils]: 147: Hoare triple {15971#(<= main_~i~0 99998)} ~i~0 := 1 + ~i~0; {15990#(<= main_~i~0 99999)} is VALID [2018-11-23 11:56:41,535 INFO L273 TraceCheckUtils]: 148: Hoare triple {15990#(<= main_~i~0 99999)} assume !(~i~0 < 100000); {15517#false} is VALID [2018-11-23 11:56:41,535 INFO L256 TraceCheckUtils]: 149: Hoare triple {15517#false} call __VERIFIER_assert(~f~0); {15517#false} is VALID [2018-11-23 11:56:41,535 INFO L273 TraceCheckUtils]: 150: Hoare triple {15517#false} ~cond := #in~cond; {15517#false} is VALID [2018-11-23 11:56:41,535 INFO L273 TraceCheckUtils]: 151: Hoare triple {15517#false} assume 0 == ~cond; {15517#false} is VALID [2018-11-23 11:56:41,536 INFO L273 TraceCheckUtils]: 152: Hoare triple {15517#false} assume !false; {15517#false} is VALID [2018-11-23 11:56:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 98 proven. 246 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-11-23 11:56:41,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:41,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2018-11-23 11:56:41,643 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 153 [2018-11-23 11:56:41,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:41,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:56:41,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:41,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:56:41,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:56:41,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:56:41,785 INFO L87 Difference]: Start difference. First operand 529 states and 759 transitions. Second operand 31 states. [2018-11-23 11:56:59,303 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-23 11:57:19,655 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-23 11:57:39,034 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-23 11:57:56,094 WARN L180 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-23 11:58:15,449 WARN L180 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-23 11:58:38,996 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 36