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_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:06:03,625 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:06:03,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:06:03,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:06:03,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:06:03,641 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:06:03,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:06:03,645 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:06:03,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:06:03,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:06:03,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:06:03,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:06:03,649 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:06:03,650 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:06:03,652 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:06:03,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:06:03,653 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:06:03,656 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:06:03,658 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:06:03,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:06:03,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:06:03,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:06:03,665 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:06:03,665 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:06:03,665 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:06:03,667 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:06:03,668 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:06:03,668 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:06:03,669 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:06:03,670 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:06:03,671 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:06:03,671 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:06:03,672 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:06:03,672 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:06:03,673 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:06:03,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:06:03,674 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 12:06:03,690 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:06:03,690 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:06:03,691 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:06:03,691 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:06:03,694 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:06:03,694 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:06:03,695 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:06:03,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:06:03,696 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:06:03,696 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:06:03,696 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:06:03,696 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:06:03,696 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:06:03,696 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:06:03,696 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:06:03,697 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:06:03,697 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:06:03,697 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:06:03,697 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:06:03,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:06:03,697 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:06:03,697 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:06:03,698 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:06:03,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:06:03,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:06:03,698 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:06:03,698 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:06:03,699 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:06:03,699 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:06:03,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:06:03,699 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:06:03,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:06:03,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:06:03,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:06:03,783 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:06:03,783 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:06:03,784 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_running_true-unreach-call.i [2018-11-23 12:06:03,847 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0d63f981/911dc39167ce4238bd31bd46107cce23/FLAGd0e28d931 [2018-11-23 12:06:04,362 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:06:04,362 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_running_true-unreach-call.i [2018-11-23 12:06:04,370 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0d63f981/911dc39167ce4238bd31bd46107cce23/FLAGd0e28d931 [2018-11-23 12:06:04,716 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0d63f981/911dc39167ce4238bd31bd46107cce23 [2018-11-23 12:06:04,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:06:04,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:06:04,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:06:04,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:06:04,733 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:06:04,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:06:04" (1/1) ... [2018-11-23 12:06:04,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ea5539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:04, skipping insertion in model container [2018-11-23 12:06:04,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:06:04" (1/1) ... [2018-11-23 12:06:04,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:06:04,778 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:06:05,071 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:06:05,079 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:06:05,118 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:06:05,149 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:06:05,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:05 WrapperNode [2018-11-23 12:06:05,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:06:05,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:06:05,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:06:05,152 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:06:05,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:05" (1/1) ... [2018-11-23 12:06:05,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:05" (1/1) ... [2018-11-23 12:06:05,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:06:05,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:06:05,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:06:05,185 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:06:05,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:05" (1/1) ... [2018-11-23 12:06:05,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:05" (1/1) ... [2018-11-23 12:06:05,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:05" (1/1) ... [2018-11-23 12:06:05,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:05" (1/1) ... [2018-11-23 12:06:05,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:05" (1/1) ... [2018-11-23 12:06:05,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:05" (1/1) ... [2018-11-23 12:06:05,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:05" (1/1) ... [2018-11-23 12:06:05,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:06:05,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:06:05,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:06:05,256 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:06:05,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:05" (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 12:06:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:06:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:06:05,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:06:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:06:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:06:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:06:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:06:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:06:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:06:05,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:06:05,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:06:05,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:06:06,088 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:06:06,088 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:06:06,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:06 BoogieIcfgContainer [2018-11-23 12:06:06,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:06:06,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:06:06,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:06:06,094 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:06:06,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:06:04" (1/3) ... [2018-11-23 12:06:06,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e0d382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:06:06, skipping insertion in model container [2018-11-23 12:06:06,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:05" (2/3) ... [2018-11-23 12:06:06,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e0d382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:06:06, skipping insertion in model container [2018-11-23 12:06:06,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:06" (3/3) ... [2018-11-23 12:06:06,098 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_running_true-unreach-call.i [2018-11-23 12:06:06,111 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:06:06,120 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:06:06,139 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:06:06,174 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:06:06,175 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:06:06,175 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:06:06,175 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:06:06,176 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:06:06,176 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:06:06,176 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:06:06,176 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:06:06,176 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:06:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:06:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:06:06,205 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:06,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:06,208 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:06,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:06,215 INFO L82 PathProgramCache]: Analyzing trace with hash -815618533, now seen corresponding path program 1 times [2018-11-23 12:06:06,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:06,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:06,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:06,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:06,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:06,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 12:06:06,390 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 12:06:06,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 12:06:06,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #79#return; {32#true} is VALID [2018-11-23 12:06:06,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2018-11-23 12:06:06,392 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 12:06:06,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 12:06:06,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~f~0 := 1;~i~0 := 0; {33#false} is VALID [2018-11-23 12:06:06,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 12:06:06,394 INFO L256 TraceCheckUtils]: 9: Hoare triple {33#false} call __VERIFIER_assert(~f~0); {33#false} is VALID [2018-11-23 12:06:06,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 12:06:06,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 12:06:06,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 12:06:06,400 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 12:06:06,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:06:06,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:06:06,408 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:06:06,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:06,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:06:06,569 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 12:06:06,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:06:06,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:06:06,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:06:06,581 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 12:06:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:06,882 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2018-11-23 12:06:06,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:06:06,882 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:06:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:06:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 12:06:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:06:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 12:06:06,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 65 transitions. [2018-11-23 12:06:07,072 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 12:06:07,085 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:06:07,086 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:06:07,093 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 12:06:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:06:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 12:06:07,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:07,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:07,159 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:07,159 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:07,163 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2018-11-23 12:06:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-11-23 12:06:07,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:07,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:07,165 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:07,165 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:07,169 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2018-11-23 12:06:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-11-23 12:06:07,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:07,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:07,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:07,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:06:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-23 12:06:07,180 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2018-11-23 12:06:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:07,180 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-23 12:06:07,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:06:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-11-23 12:06:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:06:07,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:07,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:07,182 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:07,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:07,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1988224432, now seen corresponding path program 1 times [2018-11-23 12:06:07,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:07,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:07,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:07,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:07,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:07,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {170#true} call ULTIMATE.init(); {170#true} is VALID [2018-11-23 12:06:07,292 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 12:06:07,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {170#true} assume true; {170#true} is VALID [2018-11-23 12:06:07,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {170#true} {170#true} #79#return; {170#true} is VALID [2018-11-23 12:06:07,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {170#true} call #t~ret7 := main(); {170#true} is VALID [2018-11-23 12:06:07,293 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 12:06:07,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {172#(= main_~i~0 0)} assume !(~i~0 < 100000); {171#false} is VALID [2018-11-23 12:06:07,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {171#false} ~f~0 := 1;~i~0 := 0; {171#false} is VALID [2018-11-23 12:06:07,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {171#false} assume !(~i~0 < 100000); {171#false} is VALID [2018-11-23 12:06:07,295 INFO L256 TraceCheckUtils]: 9: Hoare triple {171#false} call __VERIFIER_assert(~f~0); {171#false} is VALID [2018-11-23 12:06:07,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {171#false} ~cond := #in~cond; {171#false} is VALID [2018-11-23 12:06:07,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {171#false} assume 0 == ~cond; {171#false} is VALID [2018-11-23 12:06:07,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {171#false} assume !false; {171#false} is VALID [2018-11-23 12:06:07,297 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 12:06:07,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:06:07,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:06:07,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:06:07,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:07,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:06:07,339 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 12:06:07,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:06:07,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:06:07,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:06:07,340 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 3 states. [2018-11-23 12:06:07,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:07,570 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-11-23 12:06:07,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:06:07,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:06:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:06:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 12:06:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:06:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 12:06:07,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-23 12:06:08,033 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 12:06:08,035 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:06:08,035 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:06:08,036 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 12:06:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:06:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-23 12:06:08,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:08,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 24 states. [2018-11-23 12:06:08,065 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 24 states. [2018-11-23 12:06:08,066 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 24 states. [2018-11-23 12:06:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:08,069 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2018-11-23 12:06:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2018-11-23 12:06:08,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:08,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:08,070 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 32 states. [2018-11-23 12:06:08,070 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 32 states. [2018-11-23 12:06:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:08,073 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2018-11-23 12:06:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2018-11-23 12:06:08,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:08,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:08,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:08,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:06:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-23 12:06:08,077 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2018-11-23 12:06:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:08,077 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-23 12:06:08,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:06:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-11-23 12:06:08,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:06:08,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:08,079 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 12:06:08,079 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:08,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:08,079 INFO L82 PathProgramCache]: Analyzing trace with hash -283448979, now seen corresponding path program 1 times [2018-11-23 12:06:08,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:08,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:08,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:08,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:08,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:08,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {331#true} call ULTIMATE.init(); {331#true} is VALID [2018-11-23 12:06:08,270 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 12:06:08,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2018-11-23 12:06:08,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #79#return; {331#true} is VALID [2018-11-23 12:06:08,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {331#true} call #t~ret7 := main(); {331#true} is VALID [2018-11-23 12:06:08,272 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 12:06:08,273 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 12:06:08,273 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 12:06:08,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {331#true} ~i~0 := 1 + ~i~0; {331#true} is VALID [2018-11-23 12:06:08,273 INFO L273 TraceCheckUtils]: 9: Hoare triple {331#true} assume !(~i~0 < 100000); {331#true} is VALID [2018-11-23 12:06:08,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {331#true} ~f~0 := 1;~i~0 := 0; {331#true} is VALID [2018-11-23 12:06:08,293 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 12:06:08,308 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 12:06:08,313 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 12:06:08,315 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 12:06:08,318 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 12:06:08,318 INFO L273 TraceCheckUtils]: 16: Hoare triple {332#false} assume #t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6;~f~0 := 0; {332#false} is VALID [2018-11-23 12:06:08,319 INFO L273 TraceCheckUtils]: 17: Hoare triple {332#false} ~i~0 := 1 + ~i~0; {332#false} is VALID [2018-11-23 12:06:08,319 INFO L273 TraceCheckUtils]: 18: Hoare triple {332#false} assume !(~i~0 < 100000); {332#false} is VALID [2018-11-23 12:06:08,319 INFO L256 TraceCheckUtils]: 19: Hoare triple {332#false} call __VERIFIER_assert(~f~0); {332#false} is VALID [2018-11-23 12:06:08,319 INFO L273 TraceCheckUtils]: 20: Hoare triple {332#false} ~cond := #in~cond; {332#false} is VALID [2018-11-23 12:06:08,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {332#false} assume 0 == ~cond; {332#false} is VALID [2018-11-23 12:06:08,320 INFO L273 TraceCheckUtils]: 22: Hoare triple {332#false} assume !false; {332#false} is VALID [2018-11-23 12:06:08,324 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 12:06:08,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:06:08,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:06:08,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 12:06:08,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:08,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:06:08,377 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 12:06:08,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:06:08,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:06:08,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:06:08,379 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 5 states. [2018-11-23 12:06:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:08,648 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2018-11-23 12:06:08,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:06:08,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 12:06:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:06:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-23 12:06:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:06:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-23 12:06:08,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2018-11-23 12:06:08,815 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 12:06:08,818 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:06:08,818 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:06:08,819 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 12:06:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:06:08,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-23 12:06:08,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:08,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2018-11-23 12:06:08,841 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2018-11-23 12:06:08,842 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2018-11-23 12:06:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:08,844 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 12:06:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:06:08,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:08,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:08,846 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2018-11-23 12:06:08,846 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2018-11-23 12:06:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:08,848 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 12:06:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:06:08,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:08,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:08,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:08,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:06:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-11-23 12:06:08,852 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2018-11-23 12:06:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:08,852 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-23 12:06:08,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:06:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-11-23 12:06:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:06:08,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:08,854 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 12:06:08,854 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:08,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash 682211757, now seen corresponding path program 1 times [2018-11-23 12:06:08,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:08,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:08,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:08,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:08,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:08,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2018-11-23 12:06:08,973 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 12:06:08,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2018-11-23 12:06:08,973 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #79#return; {493#true} is VALID [2018-11-23 12:06:08,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret7 := main(); {493#true} is VALID [2018-11-23 12:06:08,977 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 12:06:08,982 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 12:06:08,982 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 12:06:08,984 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 12:06:08,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {496#(<= main_~i~0 1)} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:06:08,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#false} ~f~0 := 1;~i~0 := 0; {494#false} is VALID [2018-11-23 12:06:08,985 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 12:06:08,985 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 12:06:08,985 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 12:06:08,986 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 12:06:08,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {494#false} assume !#t~short6; {494#false} is VALID [2018-11-23 12:06:08,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {494#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {494#false} is VALID [2018-11-23 12:06:08,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {494#false} ~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:06:08,987 INFO L273 TraceCheckUtils]: 18: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:06:08,987 INFO L256 TraceCheckUtils]: 19: Hoare triple {494#false} call __VERIFIER_assert(~f~0); {494#false} is VALID [2018-11-23 12:06:08,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {494#false} ~cond := #in~cond; {494#false} is VALID [2018-11-23 12:06:08,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {494#false} assume 0 == ~cond; {494#false} is VALID [2018-11-23 12:06:08,988 INFO L273 TraceCheckUtils]: 22: Hoare triple {494#false} assume !false; {494#false} is VALID [2018-11-23 12:06:08,989 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 12:06:08,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:08,989 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 12:06:09,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:09,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:09,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2018-11-23 12:06:09,324 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 12:06:09,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2018-11-23 12:06:09,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #79#return; {493#true} is VALID [2018-11-23 12:06:09,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret7 := main(); {493#true} is VALID [2018-11-23 12:06:09,326 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 12:06:09,327 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 12:06:09,327 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 12:06:09,328 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 12:06:09,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {496#(<= main_~i~0 1)} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:06:09,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#false} ~f~0 := 1;~i~0 := 0; {494#false} is VALID [2018-11-23 12:06:09,329 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 12:06:09,329 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 12:06:09,330 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 12:06:09,330 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 12:06:09,330 INFO L273 TraceCheckUtils]: 15: Hoare triple {494#false} assume !#t~short6; {494#false} is VALID [2018-11-23 12:06:09,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {494#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {494#false} is VALID [2018-11-23 12:06:09,331 INFO L273 TraceCheckUtils]: 17: Hoare triple {494#false} ~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 12:06:09,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 12:06:09,332 INFO L256 TraceCheckUtils]: 19: Hoare triple {494#false} call __VERIFIER_assert(~f~0); {494#false} is VALID [2018-11-23 12:06:09,332 INFO L273 TraceCheckUtils]: 20: Hoare triple {494#false} ~cond := #in~cond; {494#false} is VALID [2018-11-23 12:06:09,332 INFO L273 TraceCheckUtils]: 21: Hoare triple {494#false} assume 0 == ~cond; {494#false} is VALID [2018-11-23 12:06:09,333 INFO L273 TraceCheckUtils]: 22: Hoare triple {494#false} assume !false; {494#false} is VALID [2018-11-23 12:06:09,334 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 12:06:09,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:09,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:06:09,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 12:06:09,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:09,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:06:09,413 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 12:06:09,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:06:09,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:06:09,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:06:09,414 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 5 states. [2018-11-23 12:06:09,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:09,760 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2018-11-23 12:06:09,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:06:09,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 12:06:09,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:06:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 12:06:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:06:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 12:06:09,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2018-11-23 12:06:09,911 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 12:06:09,914 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:06:09,915 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:06:09,915 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 12:06:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:06:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2018-11-23 12:06:09,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:09,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 42 states. [2018-11-23 12:06:09,938 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 42 states. [2018-11-23 12:06:09,938 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 42 states. [2018-11-23 12:06:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:09,942 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2018-11-23 12:06:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2018-11-23 12:06:09,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:09,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:09,943 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 54 states. [2018-11-23 12:06:09,943 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 54 states. [2018-11-23 12:06:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:09,947 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2018-11-23 12:06:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2018-11-23 12:06:09,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:09,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:09,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:09,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:06:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2018-11-23 12:06:09,951 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 23 [2018-11-23 12:06:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:09,951 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2018-11-23 12:06:09,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:06:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2018-11-23 12:06:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:06:09,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:09,953 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 12:06:09,954 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:09,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash -678688720, now seen corresponding path program 2 times [2018-11-23 12:06:09,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:09,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:09,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:09,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:09,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:10,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2018-11-23 12:06:10,139 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 12:06:10,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-23 12:06:10,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #79#return; {816#true} is VALID [2018-11-23 12:06:10,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret7 := main(); {816#true} is VALID [2018-11-23 12:06:10,143 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 12:06:10,144 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 12:06:10,150 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 12:06:10,151 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 12:06:10,151 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 12:06:10,153 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 12:06:10,170 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 12:06:10,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {820#(<= main_~i~0 2)} assume !(~i~0 < 100000); {817#false} is VALID [2018-11-23 12:06:10,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {817#false} ~f~0 := 1;~i~0 := 0; {817#false} is VALID [2018-11-23 12:06:10,185 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 12:06:10,185 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 12:06:10,185 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 12:06:10,186 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 12:06:10,186 INFO L273 TraceCheckUtils]: 18: Hoare triple {817#false} assume !#t~short6; {817#false} is VALID [2018-11-23 12:06:10,186 INFO L273 TraceCheckUtils]: 19: Hoare triple {817#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {817#false} is VALID [2018-11-23 12:06:10,187 INFO L273 TraceCheckUtils]: 20: Hoare triple {817#false} ~i~0 := 1 + ~i~0; {817#false} is VALID [2018-11-23 12:06:10,187 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 12:06:10,187 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 12:06:10,187 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 12:06:10,189 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 12:06:10,189 INFO L273 TraceCheckUtils]: 25: Hoare triple {817#false} assume !#t~short6; {817#false} is VALID [2018-11-23 12:06:10,189 INFO L273 TraceCheckUtils]: 26: Hoare triple {817#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {817#false} is VALID [2018-11-23 12:06:10,190 INFO L273 TraceCheckUtils]: 27: Hoare triple {817#false} ~i~0 := 1 + ~i~0; {817#false} is VALID [2018-11-23 12:06:10,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {817#false} assume !(~i~0 < 100000); {817#false} is VALID [2018-11-23 12:06:10,192 INFO L256 TraceCheckUtils]: 29: Hoare triple {817#false} call __VERIFIER_assert(~f~0); {817#false} is VALID [2018-11-23 12:06:10,192 INFO L273 TraceCheckUtils]: 30: Hoare triple {817#false} ~cond := #in~cond; {817#false} is VALID [2018-11-23 12:06:10,193 INFO L273 TraceCheckUtils]: 31: Hoare triple {817#false} assume 0 == ~cond; {817#false} is VALID [2018-11-23 12:06:10,193 INFO L273 TraceCheckUtils]: 32: Hoare triple {817#false} assume !false; {817#false} is VALID [2018-11-23 12:06:10,195 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 12:06:10,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:10,196 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 12:06:10,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:10,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:10,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:10,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:10,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2018-11-23 12:06:10,356 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 12:06:10,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-23 12:06:10,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #79#return; {816#true} is VALID [2018-11-23 12:06:10,357 INFO L256 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret7 := main(); {816#true} is VALID [2018-11-23 12:06:10,358 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 12:06:10,358 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 12:06:10,359 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 12:06:10,359 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 12:06:10,360 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 12:06:10,360 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 12:06:10,361 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 12:06:10,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {820#(<= main_~i~0 2)} assume !(~i~0 < 100000); {817#false} is VALID [2018-11-23 12:06:10,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {817#false} ~f~0 := 1;~i~0 := 0; {817#false} is VALID [2018-11-23 12:06:10,363 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 12:06:10,363 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 12:06:10,363 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 12:06:10,364 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 12:06:10,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {817#false} assume !#t~short6; {817#false} is VALID [2018-11-23 12:06:10,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {817#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {817#false} is VALID [2018-11-23 12:06:10,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {817#false} ~i~0 := 1 + ~i~0; {817#false} is VALID [2018-11-23 12:06:10,365 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 12:06:10,365 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 12:06:10,366 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 12:06:10,366 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 12:06:10,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {817#false} assume !#t~short6; {817#false} is VALID [2018-11-23 12:06:10,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {817#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {817#false} is VALID [2018-11-23 12:06:10,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {817#false} ~i~0 := 1 + ~i~0; {817#false} is VALID [2018-11-23 12:06:10,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {817#false} assume !(~i~0 < 100000); {817#false} is VALID [2018-11-23 12:06:10,367 INFO L256 TraceCheckUtils]: 29: Hoare triple {817#false} call __VERIFIER_assert(~f~0); {817#false} is VALID [2018-11-23 12:06:10,368 INFO L273 TraceCheckUtils]: 30: Hoare triple {817#false} ~cond := #in~cond; {817#false} is VALID [2018-11-23 12:06:10,368 INFO L273 TraceCheckUtils]: 31: Hoare triple {817#false} assume 0 == ~cond; {817#false} is VALID [2018-11-23 12:06:10,368 INFO L273 TraceCheckUtils]: 32: Hoare triple {817#false} assume !false; {817#false} is VALID [2018-11-23 12:06:10,370 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 12:06:10,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:10,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:06:10,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:06:10,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:10,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:06:10,427 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 12:06:10,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:06:10,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:06:10,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:06:10,429 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 6 states. [2018-11-23 12:06:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:10,733 INFO L93 Difference]: Finished difference Result 97 states and 134 transitions. [2018-11-23 12:06:10,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:06:10,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:06:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:06:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 12:06:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:06:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 12:06:10,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 92 transitions. [2018-11-23 12:06:10,909 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 12:06:10,911 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:06:10,911 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 12:06:10,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:06:10,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 12:06:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2018-11-23 12:06:10,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:10,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 56 states. [2018-11-23 12:06:10,937 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 56 states. [2018-11-23 12:06:10,937 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 56 states. [2018-11-23 12:06:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:10,941 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2018-11-23 12:06:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2018-11-23 12:06:10,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:10,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:10,942 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 68 states. [2018-11-23 12:06:10,942 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 68 states. [2018-11-23 12:06:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:10,946 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2018-11-23 12:06:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2018-11-23 12:06:10,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:10,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:10,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:10,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:06:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2018-11-23 12:06:10,951 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 33 [2018-11-23 12:06:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:10,951 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2018-11-23 12:06:10,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:06:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2018-11-23 12:06:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:06:10,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:10,953 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 12:06:10,953 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:10,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:10,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1703596237, now seen corresponding path program 3 times [2018-11-23 12:06:10,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:10,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:10,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:10,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:10,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:11,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {1242#true} call ULTIMATE.init(); {1242#true} is VALID [2018-11-23 12:06:11,066 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 12:06:11,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {1242#true} assume true; {1242#true} is VALID [2018-11-23 12:06:11,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1242#true} {1242#true} #79#return; {1242#true} is VALID [2018-11-23 12:06:11,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {1242#true} call #t~ret7 := main(); {1242#true} is VALID [2018-11-23 12:06:11,068 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 12:06:11,070 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 12:06:11,070 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 12:06:11,072 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 12:06:11,072 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 12:06:11,074 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 12:06:11,074 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 12:06:11,076 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 12:06:11,076 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 12:06:11,078 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 12:06:11,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {1247#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1243#false} is VALID [2018-11-23 12:06:11,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {1243#false} ~f~0 := 1;~i~0 := 0; {1243#false} is VALID [2018-11-23 12:06:11,079 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 12:06:11,079 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 12:06:11,080 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 12:06:11,080 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 12:06:11,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {1243#false} assume !#t~short6; {1243#false} is VALID [2018-11-23 12:06:11,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {1243#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {1243#false} is VALID [2018-11-23 12:06:11,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {1243#false} ~i~0 := 1 + ~i~0; {1243#false} is VALID [2018-11-23 12:06:11,081 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 12:06:11,081 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 12:06:11,081 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 12:06:11,081 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 12:06:11,082 INFO L273 TraceCheckUtils]: 28: Hoare triple {1243#false} assume !#t~short6; {1243#false} is VALID [2018-11-23 12:06:11,082 INFO L273 TraceCheckUtils]: 29: Hoare triple {1243#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {1243#false} is VALID [2018-11-23 12:06:11,082 INFO L273 TraceCheckUtils]: 30: Hoare triple {1243#false} ~i~0 := 1 + ~i~0; {1243#false} is VALID [2018-11-23 12:06:11,083 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 12:06:11,083 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 12:06:11,083 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 12:06:11,083 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 12:06:11,084 INFO L273 TraceCheckUtils]: 35: Hoare triple {1243#false} assume !#t~short6; {1243#false} is VALID [2018-11-23 12:06:11,084 INFO L273 TraceCheckUtils]: 36: Hoare triple {1243#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {1243#false} is VALID [2018-11-23 12:06:11,084 INFO L273 TraceCheckUtils]: 37: Hoare triple {1243#false} ~i~0 := 1 + ~i~0; {1243#false} is VALID [2018-11-23 12:06:11,085 INFO L273 TraceCheckUtils]: 38: Hoare triple {1243#false} assume !(~i~0 < 100000); {1243#false} is VALID [2018-11-23 12:06:11,085 INFO L256 TraceCheckUtils]: 39: Hoare triple {1243#false} call __VERIFIER_assert(~f~0); {1243#false} is VALID [2018-11-23 12:06:11,085 INFO L273 TraceCheckUtils]: 40: Hoare triple {1243#false} ~cond := #in~cond; {1243#false} is VALID [2018-11-23 12:06:11,085 INFO L273 TraceCheckUtils]: 41: Hoare triple {1243#false} assume 0 == ~cond; {1243#false} is VALID [2018-11-23 12:06:11,086 INFO L273 TraceCheckUtils]: 42: Hoare triple {1243#false} assume !false; {1243#false} is VALID [2018-11-23 12:06:11,089 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 12:06:11,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:11,089 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 12:06:11,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:11,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:06:11,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:11,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:11,287 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 12:06:11,294 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 12:06:11,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:11,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:11,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:11,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-23 12:06:11,952 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 12:06:11,973 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 12:06:11,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:11,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:12,017 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 12:06:12,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:12,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:12,026 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 12:06:12,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:12,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:12,083 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 12:06:12,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:69, output treesize:19 [2018-11-23 12:06:12,087 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:12,087 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 12:06:12,088 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 12:06:12,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {1242#true} call ULTIMATE.init(); {1242#true} is VALID [2018-11-23 12:06:12,475 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 12:06:12,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {1242#true} assume true; {1242#true} is VALID [2018-11-23 12:06:12,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1242#true} {1242#true} #79#return; {1242#true} is VALID [2018-11-23 12:06:12,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {1242#true} call #t~ret7 := main(); {1242#true} is VALID [2018-11-23 12:06:12,476 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 12:06:12,477 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 12:06:12,477 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 12:06:12,477 INFO L273 TraceCheckUtils]: 8: Hoare triple {1242#true} ~i~0 := 1 + ~i~0; {1242#true} is VALID [2018-11-23 12:06:12,477 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 12:06:12,478 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 12:06:12,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {1242#true} ~i~0 := 1 + ~i~0; {1242#true} is VALID [2018-11-23 12:06:12,491 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 12:06:12,492 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 12:06:12,495 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 12:06:12,496 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 12:06:12,498 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 12:06:12,499 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 12:06:12,502 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 12:06:12,503 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 12:06:12,503 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 12:06:12,504 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 12:06:12,504 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~mem5;havoc #t~mem4;havoc #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 12:06:12,505 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 12:06:12,505 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 12:06:12,506 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 12:06:12,526 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 12:06:12,535 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 12:06:12,549 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 12:06:12,563 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~mem5;havoc #t~mem4;havoc #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 12:06:12,572 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 12:06:12,587 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 12:06:12,592 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 12:06:12,594 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 12:06:12,594 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 12:06:12,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {1356#(<= main_~i~0 99998)} assume !#t~short6; {1356#(<= main_~i~0 99998)} is VALID [2018-11-23 12:06:12,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {1356#(<= main_~i~0 99998)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {1356#(<= main_~i~0 99998)} is VALID [2018-11-23 12:06:12,599 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 12:06:12,602 INFO L273 TraceCheckUtils]: 38: Hoare triple {1287#(< main_~i~0 100000)} assume !(~i~0 < 100000); {1243#false} is VALID [2018-11-23 12:06:12,602 INFO L256 TraceCheckUtils]: 39: Hoare triple {1243#false} call __VERIFIER_assert(~f~0); {1243#false} is VALID [2018-11-23 12:06:12,602 INFO L273 TraceCheckUtils]: 40: Hoare triple {1243#false} ~cond := #in~cond; {1243#false} is VALID [2018-11-23 12:06:12,602 INFO L273 TraceCheckUtils]: 41: Hoare triple {1243#false} assume 0 == ~cond; {1243#false} is VALID [2018-11-23 12:06:12,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {1243#false} assume !false; {1243#false} is VALID [2018-11-23 12:06:12,612 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 12:06:12,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:12,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-11-23 12:06:12,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 12:06:12,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:12,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:06:12,776 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 12:06:12,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:06:12,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:06:12,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:06:12,778 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand 13 states. [2018-11-23 12:06:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:15,653 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2018-11-23 12:06:15,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:06:15,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 12:06:15,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:06:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 229 transitions. [2018-11-23 12:06:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:06:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 229 transitions. [2018-11-23 12:06:15,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 229 transitions. [2018-11-23 12:06:16,126 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 12:06:16,131 INFO L225 Difference]: With dead ends: 224 [2018-11-23 12:06:16,131 INFO L226 Difference]: Without dead ends: 184 [2018-11-23 12:06:16,132 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 12:06:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-23 12:06:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 168. [2018-11-23 12:06:16,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:16,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand 168 states. [2018-11-23 12:06:16,212 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 168 states. [2018-11-23 12:06:16,212 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 168 states. [2018-11-23 12:06:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:16,221 INFO L93 Difference]: Finished difference Result 184 states and 258 transitions. [2018-11-23 12:06:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2018-11-23 12:06:16,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:16,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:16,222 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 184 states. [2018-11-23 12:06:16,223 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 184 states. [2018-11-23 12:06:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:16,231 INFO L93 Difference]: Finished difference Result 184 states and 258 transitions. [2018-11-23 12:06:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2018-11-23 12:06:16,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:16,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:16,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:16,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 12:06:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 237 transitions. [2018-11-23 12:06:16,239 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 237 transitions. Word has length 43 [2018-11-23 12:06:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:16,239 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 237 transitions. [2018-11-23 12:06:16,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:06:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 237 transitions. [2018-11-23 12:06:16,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:06:16,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:16,242 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 12:06:16,242 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:16,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:16,242 INFO L82 PathProgramCache]: Analyzing trace with hash 949112366, now seen corresponding path program 1 times [2018-11-23 12:06:16,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:16,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:16,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:16,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:16,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:16,429 INFO L256 TraceCheckUtils]: 0: Hoare triple {2245#true} call ULTIMATE.init(); {2245#true} is VALID [2018-11-23 12:06:16,429 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 12:06:16,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {2245#true} assume true; {2245#true} is VALID [2018-11-23 12:06:16,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2245#true} {2245#true} #79#return; {2245#true} is VALID [2018-11-23 12:06:16,430 INFO L256 TraceCheckUtils]: 4: Hoare triple {2245#true} call #t~ret7 := main(); {2245#true} is VALID [2018-11-23 12:06:16,431 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 12:06:16,433 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 12:06:16,435 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 12:06:16,437 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 12:06:16,444 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 12:06:16,445 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 12:06:16,445 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 12:06:16,447 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 12:06:16,447 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 12:06:16,449 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 12:06:16,449 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 12:06:16,450 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 12:06:16,451 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 12:06:16,451 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 12:06:16,451 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 12:06:16,452 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 12:06:16,453 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 12:06:16,453 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 12:06:16,454 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 12:06:16,455 INFO L273 TraceCheckUtils]: 24: Hoare triple {2253#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2246#false} is VALID [2018-11-23 12:06:16,455 INFO L273 TraceCheckUtils]: 25: Hoare triple {2246#false} ~f~0 := 1;~i~0 := 0; {2246#false} is VALID [2018-11-23 12:06:16,456 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 12:06:16,456 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 12:06:16,456 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 12:06:16,457 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 12:06:16,457 INFO L273 TraceCheckUtils]: 30: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 12:06:16,457 INFO L273 TraceCheckUtils]: 31: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {2246#false} is VALID [2018-11-23 12:06:16,458 INFO L273 TraceCheckUtils]: 32: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 12:06:16,458 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 12:06:16,458 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 12:06:16,458 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 12:06:16,459 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 12:06:16,459 INFO L273 TraceCheckUtils]: 37: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 12:06:16,459 INFO L273 TraceCheckUtils]: 38: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {2246#false} is VALID [2018-11-23 12:06:16,459 INFO L273 TraceCheckUtils]: 39: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 12:06:16,459 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 12:06:16,459 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 12:06:16,460 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 12:06:16,460 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 12:06:16,460 INFO L273 TraceCheckUtils]: 44: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 12:06:16,460 INFO L273 TraceCheckUtils]: 45: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {2246#false} is VALID [2018-11-23 12:06:16,460 INFO L273 TraceCheckUtils]: 46: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 12:06:16,460 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 12:06:16,461 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 12:06:16,461 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 12:06:16,461 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 12:06:16,461 INFO L273 TraceCheckUtils]: 51: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 12:06:16,461 INFO L273 TraceCheckUtils]: 52: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {2246#false} is VALID [2018-11-23 12:06:16,462 INFO L273 TraceCheckUtils]: 53: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 12:06:16,462 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 12:06:16,462 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 12:06:16,462 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 12:06:16,462 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 12:06:16,463 INFO L273 TraceCheckUtils]: 58: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 12:06:16,463 INFO L273 TraceCheckUtils]: 59: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {2246#false} is VALID [2018-11-23 12:06:16,463 INFO L273 TraceCheckUtils]: 60: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 12:06:16,463 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 12:06:16,463 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 12:06:16,464 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 12:06:16,464 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 12:06:16,464 INFO L273 TraceCheckUtils]: 65: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 12:06:16,464 INFO L273 TraceCheckUtils]: 66: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {2246#false} is VALID [2018-11-23 12:06:16,465 INFO L273 TraceCheckUtils]: 67: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 12:06:16,465 INFO L273 TraceCheckUtils]: 68: Hoare triple {2246#false} assume !(~i~0 < 100000); {2246#false} is VALID [2018-11-23 12:06:16,465 INFO L256 TraceCheckUtils]: 69: Hoare triple {2246#false} call __VERIFIER_assert(~f~0); {2246#false} is VALID [2018-11-23 12:06:16,465 INFO L273 TraceCheckUtils]: 70: Hoare triple {2246#false} ~cond := #in~cond; {2246#false} is VALID [2018-11-23 12:06:16,465 INFO L273 TraceCheckUtils]: 71: Hoare triple {2246#false} assume 0 == ~cond; {2246#false} is VALID [2018-11-23 12:06:16,466 INFO L273 TraceCheckUtils]: 72: Hoare triple {2246#false} assume !false; {2246#false} is VALID [2018-11-23 12:06:16,468 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 12:06:16,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:16,469 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 12:06:16,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:16,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:16,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {2245#true} call ULTIMATE.init(); {2245#true} is VALID [2018-11-23 12:06:16,954 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 12:06:16,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {2245#true} assume true; {2245#true} is VALID [2018-11-23 12:06:16,954 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2245#true} {2245#true} #79#return; {2245#true} is VALID [2018-11-23 12:06:16,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {2245#true} call #t~ret7 := main(); {2245#true} is VALID [2018-11-23 12:06:16,955 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 12:06:16,956 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 12:06:16,956 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 12:06:16,957 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 12:06:16,964 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 12:06:16,964 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 12:06:16,965 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 12:06:16,965 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 12:06:16,966 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 12:06:16,966 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 12:06:16,967 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 12:06:16,967 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 12:06:16,968 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 12:06:16,969 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 12:06:16,969 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 12:06:16,970 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 12:06:16,971 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 12:06:16,971 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 12:06:16,972 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 12:06:16,973 INFO L273 TraceCheckUtils]: 24: Hoare triple {2253#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2246#false} is VALID [2018-11-23 12:06:16,973 INFO L273 TraceCheckUtils]: 25: Hoare triple {2246#false} ~f~0 := 1;~i~0 := 0; {2246#false} is VALID [2018-11-23 12:06:16,974 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 12:06:16,974 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 12:06:16,974 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 12:06:16,974 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 12:06:16,975 INFO L273 TraceCheckUtils]: 30: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 12:06:16,975 INFO L273 TraceCheckUtils]: 31: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {2246#false} is VALID [2018-11-23 12:06:16,975 INFO L273 TraceCheckUtils]: 32: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 12:06:16,975 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 12:06:16,976 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 12:06:16,976 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 12:06:16,976 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 12:06:16,976 INFO L273 TraceCheckUtils]: 37: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 12:06:16,977 INFO L273 TraceCheckUtils]: 38: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {2246#false} is VALID [2018-11-23 12:06:16,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 12:06:16,977 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 12:06:16,977 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 12:06:16,977 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 12:06:16,977 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 12:06:16,978 INFO L273 TraceCheckUtils]: 44: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 12:06:16,978 INFO L273 TraceCheckUtils]: 45: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {2246#false} is VALID [2018-11-23 12:06:16,978 INFO L273 TraceCheckUtils]: 46: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 12:06:16,978 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 12:06:16,978 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 12:06:16,978 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 12:06:16,978 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 12:06:16,979 INFO L273 TraceCheckUtils]: 51: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 12:06:16,979 INFO L273 TraceCheckUtils]: 52: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {2246#false} is VALID [2018-11-23 12:06:16,979 INFO L273 TraceCheckUtils]: 53: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 12:06:16,979 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 12:06:16,979 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 12:06:16,980 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 12:06:16,980 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 12:06:16,980 INFO L273 TraceCheckUtils]: 58: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 12:06:16,980 INFO L273 TraceCheckUtils]: 59: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {2246#false} is VALID [2018-11-23 12:06:16,980 INFO L273 TraceCheckUtils]: 60: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 12:06:16,981 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 12:06:16,981 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 12:06:16,981 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 12:06:16,981 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 12:06:16,981 INFO L273 TraceCheckUtils]: 65: Hoare triple {2246#false} assume !#t~short6; {2246#false} is VALID [2018-11-23 12:06:16,982 INFO L273 TraceCheckUtils]: 66: Hoare triple {2246#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {2246#false} is VALID [2018-11-23 12:06:16,982 INFO L273 TraceCheckUtils]: 67: Hoare triple {2246#false} ~i~0 := 1 + ~i~0; {2246#false} is VALID [2018-11-23 12:06:16,982 INFO L273 TraceCheckUtils]: 68: Hoare triple {2246#false} assume !(~i~0 < 100000); {2246#false} is VALID [2018-11-23 12:06:16,982 INFO L256 TraceCheckUtils]: 69: Hoare triple {2246#false} call __VERIFIER_assert(~f~0); {2246#false} is VALID [2018-11-23 12:06:16,982 INFO L273 TraceCheckUtils]: 70: Hoare triple {2246#false} ~cond := #in~cond; {2246#false} is VALID [2018-11-23 12:06:16,983 INFO L273 TraceCheckUtils]: 71: Hoare triple {2246#false} assume 0 == ~cond; {2246#false} is VALID [2018-11-23 12:06:16,983 INFO L273 TraceCheckUtils]: 72: Hoare triple {2246#false} assume !false; {2246#false} is VALID [2018-11-23 12:06:16,987 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 12:06:17,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:17,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:06:17,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-23 12:06:17,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:17,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:06:17,055 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 12:06:17,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:06:17,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:06:17,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:06:17,056 INFO L87 Difference]: Start difference. First operand 168 states and 237 transitions. Second operand 10 states. [2018-11-23 12:06:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,615 INFO L93 Difference]: Finished difference Result 387 states and 543 transitions. [2018-11-23 12:06:17,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:06:17,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-23 12:06:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:06:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2018-11-23 12:06:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:06:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2018-11-23 12:06:17,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 152 transitions. [2018-11-23 12:06:17,805 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 12:06:17,811 INFO L225 Difference]: With dead ends: 387 [2018-11-23 12:06:17,811 INFO L226 Difference]: Without dead ends: 246 [2018-11-23 12:06:17,813 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 12:06:17,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-23 12:06:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 193. [2018-11-23 12:06:17,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:17,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand 193 states. [2018-11-23 12:06:17,976 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand 193 states. [2018-11-23 12:06:17,976 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 193 states. [2018-11-23 12:06:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,986 INFO L93 Difference]: Finished difference Result 246 states and 337 transitions. [2018-11-23 12:06:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 337 transitions. [2018-11-23 12:06:17,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:17,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:17,987 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 246 states. [2018-11-23 12:06:17,987 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 246 states. [2018-11-23 12:06:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,997 INFO L93 Difference]: Finished difference Result 246 states and 337 transitions. [2018-11-23 12:06:17,997 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 337 transitions. [2018-11-23 12:06:17,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:17,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:17,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:17,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-23 12:06:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2018-11-23 12:06:18,005 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 73 [2018-11-23 12:06:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:18,006 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2018-11-23 12:06:18,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:06:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2018-11-23 12:06:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:06:18,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:18,007 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 12:06:18,007 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:18,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:18,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1859115339, now seen corresponding path program 2 times [2018-11-23 12:06:18,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:18,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:18,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:18,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:18,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:18,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {3628#true} call ULTIMATE.init(); {3628#true} is VALID [2018-11-23 12:06:18,372 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 12:06:18,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {3628#true} assume true; {3628#true} is VALID [2018-11-23 12:06:18,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3628#true} {3628#true} #79#return; {3628#true} is VALID [2018-11-23 12:06:18,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {3628#true} call #t~ret7 := main(); {3628#true} is VALID [2018-11-23 12:06:18,373 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 12:06:18,375 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 12:06:18,375 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 12:06:18,378 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 12:06:18,378 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 12:06:18,380 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 12:06:18,380 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 12:06:18,382 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 12:06:18,382 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 12:06:18,382 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 12:06:18,383 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 12:06:18,383 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 12:06:18,384 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 12:06:18,384 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 12:06:18,384 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 12:06:18,385 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 12:06:18,385 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 12:06:18,385 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 12:06:18,386 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 12:06:18,387 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 12:06:18,387 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 12:06:18,388 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 12:06:18,389 INFO L273 TraceCheckUtils]: 27: Hoare triple {3637#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3629#false} is VALID [2018-11-23 12:06:18,389 INFO L273 TraceCheckUtils]: 28: Hoare triple {3629#false} ~f~0 := 1;~i~0 := 0; {3629#false} is VALID [2018-11-23 12:06:18,389 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 12:06:18,390 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 12:06:18,390 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 12:06:18,390 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 12:06:18,390 INFO L273 TraceCheckUtils]: 33: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,391 INFO L273 TraceCheckUtils]: 34: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,391 INFO L273 TraceCheckUtils]: 35: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,391 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 12:06:18,391 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 12:06:18,391 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 12:06:18,392 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 12:06:18,392 INFO L273 TraceCheckUtils]: 40: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,392 INFO L273 TraceCheckUtils]: 41: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,392 INFO L273 TraceCheckUtils]: 42: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,392 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 12:06:18,392 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 12:06:18,392 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 12:06:18,393 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 12:06:18,393 INFO L273 TraceCheckUtils]: 47: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,393 INFO L273 TraceCheckUtils]: 48: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,393 INFO L273 TraceCheckUtils]: 49: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,393 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 12:06:18,393 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 12:06:18,393 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 12:06:18,394 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 12:06:18,394 INFO L273 TraceCheckUtils]: 54: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,394 INFO L273 TraceCheckUtils]: 55: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,394 INFO L273 TraceCheckUtils]: 56: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,394 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 12:06:18,394 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 12:06:18,394 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 12:06:18,394 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 12:06:18,395 INFO L273 TraceCheckUtils]: 61: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,395 INFO L273 TraceCheckUtils]: 62: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,395 INFO L273 TraceCheckUtils]: 63: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,395 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 12:06:18,395 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 12:06:18,395 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 12:06:18,395 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 12:06:18,396 INFO L273 TraceCheckUtils]: 68: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,396 INFO L273 TraceCheckUtils]: 69: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,396 INFO L273 TraceCheckUtils]: 70: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,396 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 12:06:18,396 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 12:06:18,396 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 12:06:18,396 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 12:06:18,397 INFO L273 TraceCheckUtils]: 75: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,397 INFO L273 TraceCheckUtils]: 76: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,397 INFO L273 TraceCheckUtils]: 77: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,397 INFO L273 TraceCheckUtils]: 78: Hoare triple {3629#false} assume !(~i~0 < 100000); {3629#false} is VALID [2018-11-23 12:06:18,397 INFO L256 TraceCheckUtils]: 79: Hoare triple {3629#false} call __VERIFIER_assert(~f~0); {3629#false} is VALID [2018-11-23 12:06:18,397 INFO L273 TraceCheckUtils]: 80: Hoare triple {3629#false} ~cond := #in~cond; {3629#false} is VALID [2018-11-23 12:06:18,397 INFO L273 TraceCheckUtils]: 81: Hoare triple {3629#false} assume 0 == ~cond; {3629#false} is VALID [2018-11-23 12:06:18,398 INFO L273 TraceCheckUtils]: 82: Hoare triple {3629#false} assume !false; {3629#false} is VALID [2018-11-23 12:06:18,403 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 12:06:18,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:18,404 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 12:06:18,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:18,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:18,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:18,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:18,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {3628#true} call ULTIMATE.init(); {3628#true} is VALID [2018-11-23 12:06:18,667 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 12:06:18,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {3628#true} assume true; {3628#true} is VALID [2018-11-23 12:06:18,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3628#true} {3628#true} #79#return; {3628#true} is VALID [2018-11-23 12:06:18,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {3628#true} call #t~ret7 := main(); {3628#true} is VALID [2018-11-23 12:06:18,669 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 12:06:18,670 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 12:06:18,670 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 12:06:18,670 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 12:06:18,671 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 12:06:18,671 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 12:06:18,672 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 12:06:18,672 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 12:06:18,673 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 12:06:18,673 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 12:06:18,674 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 12:06:18,675 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 12:06:18,675 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 12:06:18,676 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 12:06:18,677 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 12:06:18,677 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 12:06:18,678 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 12:06:18,684 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 12:06:18,684 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 12:06:18,685 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 12:06:18,685 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 12:06:18,686 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 12:06:18,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {3637#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3629#false} is VALID [2018-11-23 12:06:18,688 INFO L273 TraceCheckUtils]: 28: Hoare triple {3629#false} ~f~0 := 1;~i~0 := 0; {3629#false} is VALID [2018-11-23 12:06:18,688 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 12:06:18,688 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 12:06:18,688 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 12:06:18,689 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 12:06:18,689 INFO L273 TraceCheckUtils]: 33: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,689 INFO L273 TraceCheckUtils]: 34: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,689 INFO L273 TraceCheckUtils]: 35: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,690 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 12:06:18,690 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 12:06:18,691 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 12:06:18,691 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 12:06:18,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,691 INFO L273 TraceCheckUtils]: 41: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,692 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 12:06:18,692 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 12:06:18,692 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 12:06:18,692 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 12:06:18,693 INFO L273 TraceCheckUtils]: 47: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,693 INFO L273 TraceCheckUtils]: 48: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,693 INFO L273 TraceCheckUtils]: 49: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,693 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 12:06:18,693 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 12:06:18,694 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 12:06:18,694 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 12:06:18,694 INFO L273 TraceCheckUtils]: 54: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,694 INFO L273 TraceCheckUtils]: 55: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,694 INFO L273 TraceCheckUtils]: 56: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,695 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 12:06:18,695 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 12:06:18,695 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 12:06:18,695 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 12:06:18,695 INFO L273 TraceCheckUtils]: 61: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,696 INFO L273 TraceCheckUtils]: 62: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,696 INFO L273 TraceCheckUtils]: 63: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,696 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 12:06:18,696 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 12:06:18,696 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 12:06:18,696 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 12:06:18,697 INFO L273 TraceCheckUtils]: 68: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,697 INFO L273 TraceCheckUtils]: 69: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,697 INFO L273 TraceCheckUtils]: 70: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,697 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 12:06:18,697 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 12:06:18,698 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 12:06:18,698 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 12:06:18,698 INFO L273 TraceCheckUtils]: 75: Hoare triple {3629#false} assume !#t~short6; {3629#false} is VALID [2018-11-23 12:06:18,698 INFO L273 TraceCheckUtils]: 76: Hoare triple {3629#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {3629#false} is VALID [2018-11-23 12:06:18,698 INFO L273 TraceCheckUtils]: 77: Hoare triple {3629#false} ~i~0 := 1 + ~i~0; {3629#false} is VALID [2018-11-23 12:06:18,698 INFO L273 TraceCheckUtils]: 78: Hoare triple {3629#false} assume !(~i~0 < 100000); {3629#false} is VALID [2018-11-23 12:06:18,699 INFO L256 TraceCheckUtils]: 79: Hoare triple {3629#false} call __VERIFIER_assert(~f~0); {3629#false} is VALID [2018-11-23 12:06:18,699 INFO L273 TraceCheckUtils]: 80: Hoare triple {3629#false} ~cond := #in~cond; {3629#false} is VALID [2018-11-23 12:06:18,699 INFO L273 TraceCheckUtils]: 81: Hoare triple {3629#false} assume 0 == ~cond; {3629#false} is VALID [2018-11-23 12:06:18,699 INFO L273 TraceCheckUtils]: 82: Hoare triple {3629#false} assume !false; {3629#false} is VALID [2018-11-23 12:06:18,703 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 12:06:18,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:18,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:06:18,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-11-23 12:06:18,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:18,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:06:18,791 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 12:06:18,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:06:18,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:06:18,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:06:18,793 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand 11 states. [2018-11-23 12:06:19,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:19,318 INFO L93 Difference]: Finished difference Result 434 states and 611 transitions. [2018-11-23 12:06:19,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:06:19,319 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-11-23 12:06:19,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:06:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2018-11-23 12:06:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:06:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2018-11-23 12:06:19,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 167 transitions. [2018-11-23 12:06:20,086 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 12:06:20,092 INFO L225 Difference]: With dead ends: 434 [2018-11-23 12:06:20,093 INFO L226 Difference]: Without dead ends: 271 [2018-11-23 12:06:20,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:06:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-23 12:06:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 218. [2018-11-23 12:06:20,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:20,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand 218 states. [2018-11-23 12:06:20,409 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand 218 states. [2018-11-23 12:06:20,409 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 218 states. [2018-11-23 12:06:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,420 INFO L93 Difference]: Finished difference Result 271 states and 373 transitions. [2018-11-23 12:06:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 373 transitions. [2018-11-23 12:06:20,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:20,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:20,422 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 271 states. [2018-11-23 12:06:20,422 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 271 states. [2018-11-23 12:06:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,432 INFO L93 Difference]: Finished difference Result 271 states and 373 transitions. [2018-11-23 12:06:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 373 transitions. [2018-11-23 12:06:20,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:20,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:20,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:20,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-23 12:06:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 309 transitions. [2018-11-23 12:06:20,441 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 309 transitions. Word has length 83 [2018-11-23 12:06:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:20,442 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 309 transitions. [2018-11-23 12:06:20,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:06:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 309 transitions. [2018-11-23 12:06:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 12:06:20,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:20,444 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 12:06:20,444 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:20,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:20,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1243857934, now seen corresponding path program 3 times [2018-11-23 12:06:20,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:20,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:20,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:20,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:20,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {5172#true} call ULTIMATE.init(); {5172#true} is VALID [2018-11-23 12:06:21,132 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 12:06:21,132 INFO L273 TraceCheckUtils]: 2: Hoare triple {5172#true} assume true; {5172#true} is VALID [2018-11-23 12:06:21,133 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5172#true} {5172#true} #79#return; {5172#true} is VALID [2018-11-23 12:06:21,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {5172#true} call #t~ret7 := main(); {5172#true} is VALID [2018-11-23 12:06:21,133 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 12:06:21,134 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 12:06:21,135 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 12:06:21,135 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 12:06:21,136 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 12:06:21,136 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 12:06:21,137 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 12:06:21,138 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 12:06:21,138 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 12:06:21,139 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 12:06:21,140 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 12:06:21,140 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 12:06:21,141 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 12:06:21,141 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 12:06:21,142 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 12:06:21,143 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 12:06:21,143 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 12:06:21,144 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 12:06:21,144 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 12:06:21,145 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 12:06:21,146 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 12:06:21,146 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 12:06:21,147 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 12:06:21,147 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 12:06:21,148 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 12:06:21,149 INFO L273 TraceCheckUtils]: 30: Hoare triple {5182#(<= main_~i~0 8)} assume !(~i~0 < 100000); {5173#false} is VALID [2018-11-23 12:06:21,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {5173#false} ~f~0 := 1;~i~0 := 0; {5173#false} is VALID [2018-11-23 12:06:21,149 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 12:06:21,150 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 12:06:21,150 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 12:06:21,150 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 12:06:21,150 INFO L273 TraceCheckUtils]: 36: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 12:06:21,150 INFO L273 TraceCheckUtils]: 37: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {5173#false} is VALID [2018-11-23 12:06:21,151 INFO L273 TraceCheckUtils]: 38: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 12:06:21,151 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 12:06:21,151 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 12:06:21,151 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 12:06:21,151 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 12:06:21,152 INFO L273 TraceCheckUtils]: 43: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 12:06:21,152 INFO L273 TraceCheckUtils]: 44: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {5173#false} is VALID [2018-11-23 12:06:21,152 INFO L273 TraceCheckUtils]: 45: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 12:06:21,152 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 12:06:21,152 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 12:06:21,152 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 12:06:21,152 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 12:06:21,153 INFO L273 TraceCheckUtils]: 50: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 12:06:21,153 INFO L273 TraceCheckUtils]: 51: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {5173#false} is VALID [2018-11-23 12:06:21,153 INFO L273 TraceCheckUtils]: 52: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 12:06:21,153 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 12:06:21,153 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 12:06:21,153 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 12:06:21,153 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 12:06:21,154 INFO L273 TraceCheckUtils]: 57: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 12:06:21,154 INFO L273 TraceCheckUtils]: 58: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {5173#false} is VALID [2018-11-23 12:06:21,154 INFO L273 TraceCheckUtils]: 59: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 12:06:21,154 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 12:06:21,154 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 12:06:21,154 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 12:06:21,154 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 12:06:21,154 INFO L273 TraceCheckUtils]: 64: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 12:06:21,155 INFO L273 TraceCheckUtils]: 65: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {5173#false} is VALID [2018-11-23 12:06:21,155 INFO L273 TraceCheckUtils]: 66: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 12:06:21,155 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 12:06:21,155 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 12:06:21,155 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 12:06:21,155 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 12:06:21,155 INFO L273 TraceCheckUtils]: 71: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 12:06:21,155 INFO L273 TraceCheckUtils]: 72: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {5173#false} is VALID [2018-11-23 12:06:21,156 INFO L273 TraceCheckUtils]: 73: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 12:06:21,156 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 12:06:21,156 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 12:06:21,156 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 12:06:21,156 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 12:06:21,156 INFO L273 TraceCheckUtils]: 78: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 12:06:21,156 INFO L273 TraceCheckUtils]: 79: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {5173#false} is VALID [2018-11-23 12:06:21,157 INFO L273 TraceCheckUtils]: 80: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 12:06:21,157 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 12:06:21,157 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 12:06:21,157 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 12:06:21,157 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 12:06:21,157 INFO L273 TraceCheckUtils]: 85: Hoare triple {5173#false} assume !#t~short6; {5173#false} is VALID [2018-11-23 12:06:21,158 INFO L273 TraceCheckUtils]: 86: Hoare triple {5173#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {5173#false} is VALID [2018-11-23 12:06:21,158 INFO L273 TraceCheckUtils]: 87: Hoare triple {5173#false} ~i~0 := 1 + ~i~0; {5173#false} is VALID [2018-11-23 12:06:21,158 INFO L273 TraceCheckUtils]: 88: Hoare triple {5173#false} assume !(~i~0 < 100000); {5173#false} is VALID [2018-11-23 12:06:21,158 INFO L256 TraceCheckUtils]: 89: Hoare triple {5173#false} call __VERIFIER_assert(~f~0); {5173#false} is VALID [2018-11-23 12:06:21,158 INFO L273 TraceCheckUtils]: 90: Hoare triple {5173#false} ~cond := #in~cond; {5173#false} is VALID [2018-11-23 12:06:21,159 INFO L273 TraceCheckUtils]: 91: Hoare triple {5173#false} assume 0 == ~cond; {5173#false} is VALID [2018-11-23 12:06:21,159 INFO L273 TraceCheckUtils]: 92: Hoare triple {5173#false} assume !false; {5173#false} is VALID [2018-11-23 12:06:21,164 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 12:06:21,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:21,165 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 12:06:21,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:21,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:06:21,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:21,376 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 12:06:21,380 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 12:06:21,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:21,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:21,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:21,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 12:06:21,452 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 12:06:21,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:21,457 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 12:06:21,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:21,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:21,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:21,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 12:06:22,417 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 12:06:22,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:22,445 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 12:06:22,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:06:22,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:22,487 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 12:06:22,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:22,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:22,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:22,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:22,547 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 12:06:22,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:22,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:22,606 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 12:06:22,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:87, output treesize:20 [2018-11-23 12:06:22,609 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:22,610 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 12:06:22,610 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 12:06:22,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {5172#true} call ULTIMATE.init(); {5172#true} is VALID [2018-11-23 12:06:22,938 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 12:06:22,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {5172#true} assume true; {5172#true} is VALID [2018-11-23 12:06:22,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5172#true} {5172#true} #79#return; {5172#true} is VALID [2018-11-23 12:06:22,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {5172#true} call #t~ret7 := main(); {5172#true} is VALID [2018-11-23 12:06:22,939 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 12:06:22,939 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 12:06:22,939 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 12:06:22,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {5172#true} ~i~0 := 1 + ~i~0; {5172#true} is VALID [2018-11-23 12:06:22,940 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 12:06:22,940 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 12:06:22,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {5172#true} ~i~0 := 1 + ~i~0; {5172#true} is VALID [2018-11-23 12:06:22,941 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 12:06:22,941 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 12:06:22,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {5172#true} ~i~0 := 1 + ~i~0; {5172#true} is VALID [2018-11-23 12:06:22,941 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 12:06:22,941 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 12:06:22,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {5172#true} ~i~0 := 1 + ~i~0; {5172#true} is VALID [2018-11-23 12:06:22,942 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 12:06:22,942 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 12:06:22,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {5172#true} ~i~0 := 1 + ~i~0; {5172#true} is VALID [2018-11-23 12:06:22,942 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 12:06:22,943 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 12:06:22,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {5172#true} ~i~0 := 1 + ~i~0; {5172#true} is VALID [2018-11-23 12:06:22,943 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 12:06:22,957 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 12:06:22,971 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 12:06:22,985 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 12:06:23,000 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 12:06:23,003 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 12:06:23,005 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 12:06:23,008 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 12:06:23,008 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 12:06:23,011 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 12:06:23,011 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 12:06:23,011 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 12:06:23,012 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 12:06:23,012 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~mem5;havoc #t~mem4;havoc #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 12:06:23,012 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 12:06:23,013 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 12:06:23,013 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 12:06:23,013 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 12:06:23,014 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 12:06:23,014 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 12:06:23,014 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~mem5;havoc #t~mem4;havoc #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 12:06:23,015 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 12:06:23,016 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 12:06:23,016 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 12:06:23,017 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 12:06:23,017 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 12:06:23,018 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 12:06:23,019 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~mem5;havoc #t~mem4;havoc #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 12:06:23,019 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 12:06:23,020 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 12:06:23,020 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 12:06:23,021 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 12:06:23,021 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 12:06:23,022 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 12:06:23,022 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~mem5;havoc #t~mem4;havoc #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 12:06:23,023 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 12:06:23,024 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 12:06:23,024 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 12:06:23,025 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 12:06:23,025 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 12:06:23,026 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 12:06:23,026 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~mem5;havoc #t~mem4;havoc #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 12:06:23,027 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 12:06:23,027 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 12:06:23,028 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 12:06:23,029 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 12:06:23,029 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 12:06:23,030 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 12:06:23,030 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~mem5;havoc #t~mem4;havoc #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 12:06:23,031 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 12:06:23,032 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 12:06:23,033 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 12:06:23,034 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 12:06:23,035 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 12:06:23,035 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 12:06:23,036 INFO L273 TraceCheckUtils]: 79: Hoare triple {5421#(or (<= main_~i~0 99997) (<= 100000 main_~i~0))} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {5421#(or (<= main_~i~0 99997) (<= 100000 main_~i~0))} is VALID [2018-11-23 12:06:23,037 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 12:06:23,038 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 12:06:23,038 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 12:06:23,039 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 12:06:23,040 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 12:06:23,040 INFO L273 TraceCheckUtils]: 85: Hoare triple {5438#(<= main_~i~0 99998)} assume !#t~short6; {5438#(<= main_~i~0 99998)} is VALID [2018-11-23 12:06:23,041 INFO L273 TraceCheckUtils]: 86: Hoare triple {5438#(<= main_~i~0 99998)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {5438#(<= main_~i~0 99998)} is VALID [2018-11-23 12:06:23,041 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 12:06:23,042 INFO L273 TraceCheckUtils]: 88: Hoare triple {5457#(<= main_~i~0 99999)} assume !(~i~0 < 100000); {5173#false} is VALID [2018-11-23 12:06:23,042 INFO L256 TraceCheckUtils]: 89: Hoare triple {5173#false} call __VERIFIER_assert(~f~0); {5173#false} is VALID [2018-11-23 12:06:23,043 INFO L273 TraceCheckUtils]: 90: Hoare triple {5173#false} ~cond := #in~cond; {5173#false} is VALID [2018-11-23 12:06:23,043 INFO L273 TraceCheckUtils]: 91: Hoare triple {5173#false} assume 0 == ~cond; {5173#false} is VALID [2018-11-23 12:06:23,043 INFO L273 TraceCheckUtils]: 92: Hoare triple {5173#false} assume !false; {5173#false} is VALID [2018-11-23 12:06:23,073 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 12:06:23,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:23,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-11-23 12:06:23,094 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2018-11-23 12:06:23,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:23,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:06:23,204 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 12:06:23,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:06:23,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:06:23,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:06:23,205 INFO L87 Difference]: Start difference. First operand 218 states and 309 transitions. Second operand 22 states. [2018-11-23 12:06:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:38,096 INFO L93 Difference]: Finished difference Result 769 states and 1092 transitions. [2018-11-23 12:06:38,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-23 12:06:38,096 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2018-11-23 12:06:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:06:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 474 transitions. [2018-11-23 12:06:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:06:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 474 transitions. [2018-11-23 12:06:38,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 474 transitions. [2018-11-23 12:06:39,028 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 12:06:39,044 INFO L225 Difference]: With dead ends: 769 [2018-11-23 12:06:39,044 INFO L226 Difference]: Without dead ends: 584 [2018-11-23 12:06:39,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2349 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1622, Invalid=5518, Unknown=0, NotChecked=0, Total=7140 [2018-11-23 12:06:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-11-23 12:06:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 457. [2018-11-23 12:06:39,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:39,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand 457 states. [2018-11-23 12:06:39,439 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand 457 states. [2018-11-23 12:06:39,439 INFO L87 Difference]: Start difference. First operand 584 states. Second operand 457 states. [2018-11-23 12:06:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:39,468 INFO L93 Difference]: Finished difference Result 584 states and 802 transitions. [2018-11-23 12:06:39,468 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 802 transitions. [2018-11-23 12:06:39,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:39,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:39,470 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand 584 states. [2018-11-23 12:06:39,470 INFO L87 Difference]: Start difference. First operand 457 states. Second operand 584 states. [2018-11-23 12:06:39,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:39,491 INFO L93 Difference]: Finished difference Result 584 states and 802 transitions. [2018-11-23 12:06:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 802 transitions. [2018-11-23 12:06:39,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:39,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:39,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:39,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-11-23 12:06:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 655 transitions. [2018-11-23 12:06:39,508 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 655 transitions. Word has length 93 [2018-11-23 12:06:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:39,508 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 655 transitions. [2018-11-23 12:06:39,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:06:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 655 transitions. [2018-11-23 12:06:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 12:06:39,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:39,511 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 12:06:39,511 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:39,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:39,511 INFO L82 PathProgramCache]: Analyzing trace with hash 175633360, now seen corresponding path program 4 times [2018-11-23 12:06:39,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:39,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:39,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:39,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:40,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {8177#true} call ULTIMATE.init(); {8177#true} is VALID [2018-11-23 12:06:40,345 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 12:06:40,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {8177#true} assume true; {8177#true} is VALID [2018-11-23 12:06:40,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8177#true} {8177#true} #79#return; {8177#true} is VALID [2018-11-23 12:06:40,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {8177#true} call #t~ret7 := main(); {8177#true} is VALID [2018-11-23 12:06:40,347 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 12:06:40,347 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 12:06:40,348 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 12:06:40,349 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 12:06:40,349 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 12:06:40,350 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 12:06:40,350 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 12:06:40,351 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 12:06:40,352 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 12:06:40,352 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 12:06:40,353 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 12:06:40,353 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 12:06:40,354 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 12:06:40,355 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 12:06:40,355 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 12:06:40,356 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 12:06:40,357 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 12:06:40,357 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 12:06:40,358 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 12:06:40,358 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 12:06:40,359 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 12:06:40,360 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 12:06:40,360 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 12:06:40,361 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 12:06:40,361 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 12:06:40,362 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 12:06:40,363 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 12:06:40,363 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 12:06:40,383 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 12:06:40,397 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 12:06:40,410 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 12:06:40,418 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 12:06:40,432 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 12:06:40,436 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 12:06:40,436 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 12:06:40,437 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 12:06:40,454 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 12:06:40,462 INFO L273 TraceCheckUtils]: 42: Hoare triple {8191#(<= main_~i~0 12)} assume !(~i~0 < 100000); {8178#false} is VALID [2018-11-23 12:06:40,463 INFO L273 TraceCheckUtils]: 43: Hoare triple {8178#false} ~f~0 := 1;~i~0 := 0; {8178#false} is VALID [2018-11-23 12:06:40,463 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 12:06:40,463 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 12:06:40,463 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 12:06:40,463 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 12:06:40,464 INFO L273 TraceCheckUtils]: 48: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,464 INFO L273 TraceCheckUtils]: 49: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,464 INFO L273 TraceCheckUtils]: 50: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,464 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 12:06:40,464 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 12:06:40,464 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 12:06:40,465 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 12:06:40,465 INFO L273 TraceCheckUtils]: 55: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,465 INFO L273 TraceCheckUtils]: 56: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,465 INFO L273 TraceCheckUtils]: 57: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,465 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 12:06:40,465 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 12:06:40,466 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 12:06:40,466 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 12:06:40,466 INFO L273 TraceCheckUtils]: 62: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,466 INFO L273 TraceCheckUtils]: 63: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,466 INFO L273 TraceCheckUtils]: 64: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,466 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 12:06:40,467 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 12:06:40,467 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 12:06:40,467 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 12:06:40,467 INFO L273 TraceCheckUtils]: 69: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,467 INFO L273 TraceCheckUtils]: 70: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,467 INFO L273 TraceCheckUtils]: 71: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,467 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 12:06:40,468 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 12:06:40,468 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 12:06:40,468 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 12:06:40,468 INFO L273 TraceCheckUtils]: 76: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,468 INFO L273 TraceCheckUtils]: 77: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,468 INFO L273 TraceCheckUtils]: 78: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,469 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 12:06:40,469 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 12:06:40,469 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 12:06:40,469 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 12:06:40,469 INFO L273 TraceCheckUtils]: 83: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,469 INFO L273 TraceCheckUtils]: 84: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,470 INFO L273 TraceCheckUtils]: 85: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,470 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 12:06:40,470 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 12:06:40,470 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 12:06:40,470 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 12:06:40,470 INFO L273 TraceCheckUtils]: 90: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,471 INFO L273 TraceCheckUtils]: 91: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,471 INFO L273 TraceCheckUtils]: 92: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,471 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 12:06:40,471 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 12:06:40,471 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 12:06:40,471 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 12:06:40,472 INFO L273 TraceCheckUtils]: 97: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,472 INFO L273 TraceCheckUtils]: 98: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,472 INFO L273 TraceCheckUtils]: 99: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,472 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 12:06:40,472 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 12:06:40,472 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 12:06:40,473 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 12:06:40,473 INFO L273 TraceCheckUtils]: 104: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,473 INFO L273 TraceCheckUtils]: 105: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,473 INFO L273 TraceCheckUtils]: 106: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,473 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 12:06:40,473 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 12:06:40,474 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 12:06:40,474 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 12:06:40,474 INFO L273 TraceCheckUtils]: 111: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,474 INFO L273 TraceCheckUtils]: 112: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,474 INFO L273 TraceCheckUtils]: 113: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,474 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 12:06:40,475 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 12:06:40,475 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 12:06:40,475 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 12:06:40,475 INFO L273 TraceCheckUtils]: 118: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,475 INFO L273 TraceCheckUtils]: 119: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,475 INFO L273 TraceCheckUtils]: 120: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,476 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 12:06:40,476 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 12:06:40,476 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 12:06:40,476 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 12:06:40,476 INFO L273 TraceCheckUtils]: 125: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,476 INFO L273 TraceCheckUtils]: 126: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,477 INFO L273 TraceCheckUtils]: 127: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,477 INFO L273 TraceCheckUtils]: 128: Hoare triple {8178#false} assume !(~i~0 < 100000); {8178#false} is VALID [2018-11-23 12:06:40,477 INFO L256 TraceCheckUtils]: 129: Hoare triple {8178#false} call __VERIFIER_assert(~f~0); {8178#false} is VALID [2018-11-23 12:06:40,477 INFO L273 TraceCheckUtils]: 130: Hoare triple {8178#false} ~cond := #in~cond; {8178#false} is VALID [2018-11-23 12:06:40,477 INFO L273 TraceCheckUtils]: 131: Hoare triple {8178#false} assume 0 == ~cond; {8178#false} is VALID [2018-11-23 12:06:40,477 INFO L273 TraceCheckUtils]: 132: Hoare triple {8178#false} assume !false; {8178#false} is VALID [2018-11-23 12:06:40,487 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 12:06:40,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:40,488 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 12:06:40,500 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:40,604 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:40,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:40,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:40,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {8177#true} call ULTIMATE.init(); {8177#true} is VALID [2018-11-23 12:06:40,887 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 12:06:40,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {8177#true} assume true; {8177#true} is VALID [2018-11-23 12:06:40,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8177#true} {8177#true} #79#return; {8177#true} is VALID [2018-11-23 12:06:40,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {8177#true} call #t~ret7 := main(); {8177#true} is VALID [2018-11-23 12:06:40,888 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 12:06:40,889 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 12:06:40,890 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 12:06:40,890 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 12:06:40,891 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 12:06:40,891 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 12:06:40,891 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 12:06:40,892 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 12:06:40,892 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 12:06:40,893 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 12:06:40,893 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 12:06:40,894 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 12:06:40,895 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 12:06:40,895 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 12:06:40,896 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 12:06:40,896 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 12:06:40,897 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 12:06:40,897 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 12:06:40,898 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 12:06:40,899 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 12:06:40,899 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 12:06:40,900 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 12:06:40,901 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 12:06:40,901 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 12:06:40,902 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 12:06:40,902 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 12:06:40,903 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 12:06:40,904 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 12:06:40,904 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 12:06:40,905 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 12:06:40,905 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 12:06:40,906 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 12:06:40,907 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 12:06:40,907 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 12:06:40,908 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 12:06:40,908 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 12:06:40,909 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 12:06:40,910 INFO L273 TraceCheckUtils]: 42: Hoare triple {8191#(<= main_~i~0 12)} assume !(~i~0 < 100000); {8178#false} is VALID [2018-11-23 12:06:40,910 INFO L273 TraceCheckUtils]: 43: Hoare triple {8178#false} ~f~0 := 1;~i~0 := 0; {8178#false} is VALID [2018-11-23 12:06:40,910 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 12:06:40,910 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 12:06:40,911 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 12:06:40,911 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 12:06:40,911 INFO L273 TraceCheckUtils]: 48: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,911 INFO L273 TraceCheckUtils]: 49: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,912 INFO L273 TraceCheckUtils]: 50: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,912 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 12:06:40,912 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 12:06:40,912 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 12:06:40,912 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 12:06:40,913 INFO L273 TraceCheckUtils]: 55: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,913 INFO L273 TraceCheckUtils]: 56: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,913 INFO L273 TraceCheckUtils]: 57: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,913 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 12:06:40,913 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 12:06:40,914 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 12:06:40,914 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 12:06:40,914 INFO L273 TraceCheckUtils]: 62: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,914 INFO L273 TraceCheckUtils]: 63: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,914 INFO L273 TraceCheckUtils]: 64: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,915 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 12:06:40,915 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 12:06:40,915 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 12:06:40,915 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 12:06:40,915 INFO L273 TraceCheckUtils]: 69: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,915 INFO L273 TraceCheckUtils]: 70: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,916 INFO L273 TraceCheckUtils]: 71: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,916 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 12:06:40,916 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 12:06:40,916 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 12:06:40,916 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 12:06:40,916 INFO L273 TraceCheckUtils]: 76: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,916 INFO L273 TraceCheckUtils]: 77: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,916 INFO L273 TraceCheckUtils]: 78: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,916 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 12:06:40,917 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 12:06:40,917 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 12:06:40,917 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 12:06:40,917 INFO L273 TraceCheckUtils]: 83: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,917 INFO L273 TraceCheckUtils]: 84: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,917 INFO L273 TraceCheckUtils]: 85: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,917 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 12:06:40,918 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 12:06:40,918 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 12:06:40,918 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 12:06:40,918 INFO L273 TraceCheckUtils]: 90: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,918 INFO L273 TraceCheckUtils]: 91: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,918 INFO L273 TraceCheckUtils]: 92: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,918 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 12:06:40,918 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 12:06:40,919 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 12:06:40,919 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 12:06:40,919 INFO L273 TraceCheckUtils]: 97: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,919 INFO L273 TraceCheckUtils]: 98: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,919 INFO L273 TraceCheckUtils]: 99: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,919 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 12:06:40,919 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 12:06:40,919 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 12:06:40,920 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 12:06:40,920 INFO L273 TraceCheckUtils]: 104: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,920 INFO L273 TraceCheckUtils]: 105: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,920 INFO L273 TraceCheckUtils]: 106: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,920 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 12:06:40,920 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 12:06:40,920 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 12:06:40,920 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 12:06:40,920 INFO L273 TraceCheckUtils]: 111: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,921 INFO L273 TraceCheckUtils]: 112: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,921 INFO L273 TraceCheckUtils]: 113: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,921 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 12:06:40,921 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 12:06:40,921 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 12:06:40,921 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 12:06:40,921 INFO L273 TraceCheckUtils]: 118: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,921 INFO L273 TraceCheckUtils]: 119: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,922 INFO L273 TraceCheckUtils]: 120: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,922 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 12:06:40,922 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 12:06:40,922 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 12:06:40,922 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 12:06:40,922 INFO L273 TraceCheckUtils]: 125: Hoare triple {8178#false} assume !#t~short6; {8178#false} is VALID [2018-11-23 12:06:40,922 INFO L273 TraceCheckUtils]: 126: Hoare triple {8178#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {8178#false} is VALID [2018-11-23 12:06:40,922 INFO L273 TraceCheckUtils]: 127: Hoare triple {8178#false} ~i~0 := 1 + ~i~0; {8178#false} is VALID [2018-11-23 12:06:40,922 INFO L273 TraceCheckUtils]: 128: Hoare triple {8178#false} assume !(~i~0 < 100000); {8178#false} is VALID [2018-11-23 12:06:40,923 INFO L256 TraceCheckUtils]: 129: Hoare triple {8178#false} call __VERIFIER_assert(~f~0); {8178#false} is VALID [2018-11-23 12:06:40,923 INFO L273 TraceCheckUtils]: 130: Hoare triple {8178#false} ~cond := #in~cond; {8178#false} is VALID [2018-11-23 12:06:40,923 INFO L273 TraceCheckUtils]: 131: Hoare triple {8178#false} assume 0 == ~cond; {8178#false} is VALID [2018-11-23 12:06:40,923 INFO L273 TraceCheckUtils]: 132: Hoare triple {8178#false} assume !false; {8178#false} is VALID [2018-11-23 12:06:40,930 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 12:06:40,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:40,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:06:40,950 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 133 [2018-11-23 12:06:40,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:40,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:06:41,008 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 12:06:41,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:06:41,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:06:41,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:06:41,009 INFO L87 Difference]: Start difference. First operand 457 states and 655 transitions. Second operand 16 states. [2018-11-23 12:06:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:42,966 INFO L93 Difference]: Finished difference Result 1093 states and 1558 transitions. [2018-11-23 12:06:42,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:06:42,966 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 133 [2018-11-23 12:06:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:06:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 242 transitions. [2018-11-23 12:06:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:06:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 242 transitions. [2018-11-23 12:06:42,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 242 transitions. [2018-11-23 12:06:43,620 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 12:06:43,641 INFO L225 Difference]: With dead ends: 1093 [2018-11-23 12:06:43,641 INFO L226 Difference]: Without dead ends: 686 [2018-11-23 12:06:43,642 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 12:06:43,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-11-23 12:06:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 493. [2018-11-23 12:06:44,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:44,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 686 states. Second operand 493 states. [2018-11-23 12:06:44,187 INFO L74 IsIncluded]: Start isIncluded. First operand 686 states. Second operand 493 states. [2018-11-23 12:06:44,187 INFO L87 Difference]: Start difference. First operand 686 states. Second operand 493 states. [2018-11-23 12:06:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:44,212 INFO L93 Difference]: Finished difference Result 686 states and 963 transitions. [2018-11-23 12:06:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 963 transitions. [2018-11-23 12:06:44,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:44,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:44,213 INFO L74 IsIncluded]: Start isIncluded. First operand 493 states. Second operand 686 states. [2018-11-23 12:06:44,214 INFO L87 Difference]: Start difference. First operand 493 states. Second operand 686 states. [2018-11-23 12:06:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:44,237 INFO L93 Difference]: Finished difference Result 686 states and 963 transitions. [2018-11-23 12:06:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 963 transitions. [2018-11-23 12:06:44,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:44,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:44,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:44,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-11-23 12:06:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 707 transitions. [2018-11-23 12:06:44,252 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 707 transitions. Word has length 133 [2018-11-23 12:06:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:44,252 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 707 transitions. [2018-11-23 12:06:44,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:06:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 707 transitions. [2018-11-23 12:06:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-23 12:06:44,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:44,255 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 12:06:44,255 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:44,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:44,255 INFO L82 PathProgramCache]: Analyzing trace with hash -335758675, now seen corresponding path program 5 times [2018-11-23 12:06:44,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:44,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:44,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:44,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:44,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:44,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {11737#true} call ULTIMATE.init(); {11737#true} is VALID [2018-11-23 12:06:44,522 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 12:06:44,523 INFO L273 TraceCheckUtils]: 2: Hoare triple {11737#true} assume true; {11737#true} is VALID [2018-11-23 12:06:44,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11737#true} {11737#true} #79#return; {11737#true} is VALID [2018-11-23 12:06:44,523 INFO L256 TraceCheckUtils]: 4: Hoare triple {11737#true} call #t~ret7 := main(); {11737#true} is VALID [2018-11-23 12:06:44,524 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 12:06:44,524 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 12:06:44,525 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 12:06:44,525 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 12:06:44,525 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 12:06:44,526 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 12:06:44,526 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 12:06:44,526 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 12:06:44,527 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 12:06:44,527 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 12:06:44,528 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 12:06:44,528 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 12:06:44,529 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 12:06:44,530 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 12:06:44,530 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 12:06:44,531 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 12:06:44,532 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 12:06:44,532 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 12:06:44,533 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 12:06:44,533 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 12:06:44,534 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 12:06:44,535 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 12:06:44,535 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 12:06:44,536 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 12:06:44,537 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 12:06:44,537 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 12:06:44,538 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 12:06:44,538 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 12:06:44,539 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 12:06:44,539 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 12:06:44,540 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 12:06:44,541 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 12:06:44,541 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 12:06:44,542 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 12:06:44,543 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 12:06:44,543 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 12:06:44,544 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 12:06:44,544 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 12:06:44,545 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 12:06:44,546 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 12:06:44,546 INFO L273 TraceCheckUtils]: 45: Hoare triple {11752#(<= main_~i~0 13)} assume !(~i~0 < 100000); {11738#false} is VALID [2018-11-23 12:06:44,547 INFO L273 TraceCheckUtils]: 46: Hoare triple {11738#false} ~f~0 := 1;~i~0 := 0; {11738#false} is VALID [2018-11-23 12:06:44,547 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 12:06:44,547 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 12:06:44,547 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 12:06:44,547 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 12:06:44,548 INFO L273 TraceCheckUtils]: 51: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,548 INFO L273 TraceCheckUtils]: 52: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,548 INFO L273 TraceCheckUtils]: 53: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,548 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 12:06:44,548 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 12:06:44,549 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 12:06:44,549 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 12:06:44,549 INFO L273 TraceCheckUtils]: 58: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,549 INFO L273 TraceCheckUtils]: 59: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,549 INFO L273 TraceCheckUtils]: 60: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,550 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 12:06:44,550 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 12:06:44,550 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 12:06:44,550 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 12:06:44,550 INFO L273 TraceCheckUtils]: 65: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,551 INFO L273 TraceCheckUtils]: 66: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,551 INFO L273 TraceCheckUtils]: 67: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,551 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 12:06:44,551 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 12:06:44,551 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 12:06:44,551 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 12:06:44,552 INFO L273 TraceCheckUtils]: 72: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,552 INFO L273 TraceCheckUtils]: 73: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,552 INFO L273 TraceCheckUtils]: 74: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,552 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 12:06:44,552 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 12:06:44,552 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 12:06:44,552 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 12:06:44,552 INFO L273 TraceCheckUtils]: 79: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,552 INFO L273 TraceCheckUtils]: 80: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,553 INFO L273 TraceCheckUtils]: 81: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,553 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 12:06:44,553 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 12:06:44,553 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 12:06:44,553 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 12:06:44,553 INFO L273 TraceCheckUtils]: 86: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,553 INFO L273 TraceCheckUtils]: 87: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,553 INFO L273 TraceCheckUtils]: 88: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,553 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 12:06:44,554 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 12:06:44,554 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 12:06:44,554 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 12:06:44,554 INFO L273 TraceCheckUtils]: 93: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,554 INFO L273 TraceCheckUtils]: 94: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,554 INFO L273 TraceCheckUtils]: 95: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,554 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 12:06:44,554 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 12:06:44,555 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 12:06:44,555 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 12:06:44,555 INFO L273 TraceCheckUtils]: 100: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,555 INFO L273 TraceCheckUtils]: 101: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,555 INFO L273 TraceCheckUtils]: 102: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,555 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 12:06:44,555 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 12:06:44,555 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 12:06:44,556 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 12:06:44,556 INFO L273 TraceCheckUtils]: 107: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,556 INFO L273 TraceCheckUtils]: 108: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,556 INFO L273 TraceCheckUtils]: 109: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,556 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 12:06:44,556 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 12:06:44,556 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 12:06:44,556 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 12:06:44,556 INFO L273 TraceCheckUtils]: 114: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,557 INFO L273 TraceCheckUtils]: 115: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,557 INFO L273 TraceCheckUtils]: 116: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,557 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 12:06:44,557 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 12:06:44,557 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 12:06:44,557 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 12:06:44,557 INFO L273 TraceCheckUtils]: 121: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,557 INFO L273 TraceCheckUtils]: 122: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,558 INFO L273 TraceCheckUtils]: 123: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,558 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 12:06:44,558 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 12:06:44,558 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 12:06:44,558 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 12:06:44,558 INFO L273 TraceCheckUtils]: 128: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,558 INFO L273 TraceCheckUtils]: 129: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,558 INFO L273 TraceCheckUtils]: 130: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,558 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 12:06:44,559 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 12:06:44,559 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 12:06:44,559 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 12:06:44,559 INFO L273 TraceCheckUtils]: 135: Hoare triple {11738#false} assume !#t~short6; {11738#false} is VALID [2018-11-23 12:06:44,559 INFO L273 TraceCheckUtils]: 136: Hoare triple {11738#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11738#false} is VALID [2018-11-23 12:06:44,559 INFO L273 TraceCheckUtils]: 137: Hoare triple {11738#false} ~i~0 := 1 + ~i~0; {11738#false} is VALID [2018-11-23 12:06:44,559 INFO L273 TraceCheckUtils]: 138: Hoare triple {11738#false} assume !(~i~0 < 100000); {11738#false} is VALID [2018-11-23 12:06:44,559 INFO L256 TraceCheckUtils]: 139: Hoare triple {11738#false} call __VERIFIER_assert(~f~0); {11738#false} is VALID [2018-11-23 12:06:44,560 INFO L273 TraceCheckUtils]: 140: Hoare triple {11738#false} ~cond := #in~cond; {11738#false} is VALID [2018-11-23 12:06:44,560 INFO L273 TraceCheckUtils]: 141: Hoare triple {11738#false} assume 0 == ~cond; {11738#false} is VALID [2018-11-23 12:06:44,560 INFO L273 TraceCheckUtils]: 142: Hoare triple {11738#false} assume !false; {11738#false} is VALID [2018-11-23 12:06:44,568 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 12:06:44,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:44,568 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 12:06:44,576 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:44,802 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-11-23 12:06:44,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:44,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:44,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {11737#true} call ULTIMATE.init(); {11737#true} is VALID [2018-11-23 12:06:44,998 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 12:06:44,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {11737#true} assume true; {11737#true} is VALID [2018-11-23 12:06:44,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11737#true} {11737#true} #79#return; {11737#true} is VALID [2018-11-23 12:06:44,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {11737#true} call #t~ret7 := main(); {11737#true} is VALID [2018-11-23 12:06:44,999 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 12:06:44,999 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 12:06:45,000 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 12:06:45,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,000 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 12:06:45,000 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 12:06:45,001 INFO L273 TraceCheckUtils]: 11: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,001 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 12:06:45,001 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 12:06:45,001 INFO L273 TraceCheckUtils]: 14: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,001 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 12:06:45,001 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 12:06:45,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,002 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 12:06:45,002 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 12:06:45,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,002 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 12:06:45,002 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 12:06:45,002 INFO L273 TraceCheckUtils]: 23: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,002 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 12:06:45,002 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 12:06:45,002 INFO L273 TraceCheckUtils]: 26: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,003 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 12:06:45,003 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 12:06:45,003 INFO L273 TraceCheckUtils]: 29: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,003 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 12:06:45,003 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 12:06:45,003 INFO L273 TraceCheckUtils]: 32: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,003 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 12:06:45,003 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 12:06:45,004 INFO L273 TraceCheckUtils]: 35: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,004 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 12:06:45,004 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 12:06:45,004 INFO L273 TraceCheckUtils]: 38: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,004 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 12:06:45,004 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 12:06:45,004 INFO L273 TraceCheckUtils]: 41: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,004 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 12:06:45,005 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 12:06:45,005 INFO L273 TraceCheckUtils]: 44: Hoare triple {11737#true} ~i~0 := 1 + ~i~0; {11737#true} is VALID [2018-11-23 12:06:45,005 INFO L273 TraceCheckUtils]: 45: Hoare triple {11737#true} assume !(~i~0 < 100000); {11737#true} is VALID [2018-11-23 12:06:45,005 INFO L273 TraceCheckUtils]: 46: Hoare triple {11737#true} ~f~0 := 1;~i~0 := 0; {11894#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:45,006 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 12:06:45,006 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 12:06:45,006 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 12:06:45,006 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 12:06:45,007 INFO L273 TraceCheckUtils]: 51: Hoare triple {11894#(<= main_~i~0 0)} assume !#t~short6; {11894#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:45,007 INFO L273 TraceCheckUtils]: 52: Hoare triple {11894#(<= main_~i~0 0)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11894#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:45,008 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 12:06:45,008 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 12:06:45,008 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 12:06:45,009 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 12:06:45,009 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 12:06:45,010 INFO L273 TraceCheckUtils]: 58: Hoare triple {11740#(<= main_~i~0 1)} assume !#t~short6; {11740#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:45,010 INFO L273 TraceCheckUtils]: 59: Hoare triple {11740#(<= main_~i~0 1)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11740#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:45,011 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 12:06:45,012 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 12:06:45,012 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 12:06:45,013 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 12:06:45,013 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 12:06:45,014 INFO L273 TraceCheckUtils]: 65: Hoare triple {11741#(<= main_~i~0 2)} assume !#t~short6; {11741#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:45,014 INFO L273 TraceCheckUtils]: 66: Hoare triple {11741#(<= main_~i~0 2)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11741#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:45,015 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 12:06:45,015 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 12:06:45,016 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 12:06:45,016 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 12:06:45,017 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 12:06:45,017 INFO L273 TraceCheckUtils]: 72: Hoare triple {11742#(<= main_~i~0 3)} assume !#t~short6; {11742#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:45,018 INFO L273 TraceCheckUtils]: 73: Hoare triple {11742#(<= main_~i~0 3)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11742#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:45,019 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 12:06:45,019 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 12:06:45,020 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 12:06:45,020 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 12:06:45,021 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 12:06:45,021 INFO L273 TraceCheckUtils]: 79: Hoare triple {11743#(<= main_~i~0 4)} assume !#t~short6; {11743#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:45,022 INFO L273 TraceCheckUtils]: 80: Hoare triple {11743#(<= main_~i~0 4)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11743#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:45,022 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 12:06:45,023 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 12:06:45,023 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 12:06:45,024 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 12:06:45,024 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 12:06:45,025 INFO L273 TraceCheckUtils]: 86: Hoare triple {11744#(<= main_~i~0 5)} assume !#t~short6; {11744#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:45,025 INFO L273 TraceCheckUtils]: 87: Hoare triple {11744#(<= main_~i~0 5)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11744#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:45,026 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 12:06:45,027 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 12:06:45,027 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 12:06:45,028 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 12:06:45,028 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 12:06:45,029 INFO L273 TraceCheckUtils]: 93: Hoare triple {11745#(<= main_~i~0 6)} assume !#t~short6; {11745#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:45,029 INFO L273 TraceCheckUtils]: 94: Hoare triple {11745#(<= main_~i~0 6)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11745#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:45,030 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 12:06:45,030 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 12:06:45,031 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 12:06:45,032 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 12:06:45,032 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 12:06:45,033 INFO L273 TraceCheckUtils]: 100: Hoare triple {11746#(<= main_~i~0 7)} assume !#t~short6; {11746#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:45,033 INFO L273 TraceCheckUtils]: 101: Hoare triple {11746#(<= main_~i~0 7)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11746#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:45,034 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 12:06:45,034 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 12:06:45,035 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 12:06:45,035 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 12:06:45,036 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 12:06:45,036 INFO L273 TraceCheckUtils]: 107: Hoare triple {11747#(<= main_~i~0 8)} assume !#t~short6; {11747#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:45,037 INFO L273 TraceCheckUtils]: 108: Hoare triple {11747#(<= main_~i~0 8)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11747#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:45,038 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 12:06:45,038 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 12:06:45,039 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 12:06:45,039 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 12:06:45,040 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 12:06:45,040 INFO L273 TraceCheckUtils]: 114: Hoare triple {11748#(<= main_~i~0 9)} assume !#t~short6; {11748#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:45,041 INFO L273 TraceCheckUtils]: 115: Hoare triple {11748#(<= main_~i~0 9)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11748#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:45,042 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 12:06:45,042 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 12:06:45,043 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 12:06:45,043 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 12:06:45,044 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 12:06:45,044 INFO L273 TraceCheckUtils]: 121: Hoare triple {11749#(<= main_~i~0 10)} assume !#t~short6; {11749#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:45,045 INFO L273 TraceCheckUtils]: 122: Hoare triple {11749#(<= main_~i~0 10)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11749#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:45,046 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 12:06:45,046 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 12:06:45,047 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 12:06:45,047 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 12:06:45,048 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 12:06:45,048 INFO L273 TraceCheckUtils]: 128: Hoare triple {11750#(<= main_~i~0 11)} assume !#t~short6; {11750#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:45,049 INFO L273 TraceCheckUtils]: 129: Hoare triple {11750#(<= main_~i~0 11)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11750#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:45,050 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 12:06:45,050 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 12:06:45,051 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 12:06:45,051 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 12:06:45,052 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 12:06:45,052 INFO L273 TraceCheckUtils]: 135: Hoare triple {11751#(<= main_~i~0 12)} assume !#t~short6; {11751#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:45,053 INFO L273 TraceCheckUtils]: 136: Hoare triple {11751#(<= main_~i~0 12)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {11751#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:45,065 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 12:06:45,067 INFO L273 TraceCheckUtils]: 138: Hoare triple {11752#(<= main_~i~0 13)} assume !(~i~0 < 100000); {11738#false} is VALID [2018-11-23 12:06:45,067 INFO L256 TraceCheckUtils]: 139: Hoare triple {11738#false} call __VERIFIER_assert(~f~0); {11738#false} is VALID [2018-11-23 12:06:45,067 INFO L273 TraceCheckUtils]: 140: Hoare triple {11738#false} ~cond := #in~cond; {11738#false} is VALID [2018-11-23 12:06:45,067 INFO L273 TraceCheckUtils]: 141: Hoare triple {11738#false} assume 0 == ~cond; {11738#false} is VALID [2018-11-23 12:06:45,067 INFO L273 TraceCheckUtils]: 142: Hoare triple {11738#false} assume !false; {11738#false} is VALID [2018-11-23 12:06:45,078 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 12:06:45,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:45,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:06:45,098 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2018-11-23 12:06:45,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:45,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:06:45,257 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 12:06:45,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:06:45,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:06:45,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:06:45,258 INFO L87 Difference]: Start difference. First operand 493 states and 707 transitions. Second operand 17 states. [2018-11-23 12:06:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:47,056 INFO L93 Difference]: Finished difference Result 1162 states and 1658 transitions. [2018-11-23 12:06:47,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:06:47,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2018-11-23 12:06:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:06:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 257 transitions. [2018-11-23 12:06:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:06:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 257 transitions. [2018-11-23 12:06:47,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 257 transitions. [2018-11-23 12:06:47,365 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 12:06:47,388 INFO L225 Difference]: With dead ends: 1162 [2018-11-23 12:06:47,388 INFO L226 Difference]: Without dead ends: 722 [2018-11-23 12:06:47,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:06:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-11-23 12:06:47,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 529. [2018-11-23 12:06:47,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:47,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 722 states. Second operand 529 states. [2018-11-23 12:06:47,790 INFO L74 IsIncluded]: Start isIncluded. First operand 722 states. Second operand 529 states. [2018-11-23 12:06:47,790 INFO L87 Difference]: Start difference. First operand 722 states. Second operand 529 states. [2018-11-23 12:06:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:47,815 INFO L93 Difference]: Finished difference Result 722 states and 1015 transitions. [2018-11-23 12:06:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1015 transitions. [2018-11-23 12:06:47,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:47,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:47,817 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand 722 states. [2018-11-23 12:06:47,817 INFO L87 Difference]: Start difference. First operand 529 states. Second operand 722 states. [2018-11-23 12:06:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:47,845 INFO L93 Difference]: Finished difference Result 722 states and 1015 transitions. [2018-11-23 12:06:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1015 transitions. [2018-11-23 12:06:47,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:47,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:47,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:47,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-23 12:06:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 759 transitions. [2018-11-23 12:06:47,866 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 759 transitions. Word has length 143 [2018-11-23 12:06:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:47,866 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 759 transitions. [2018-11-23 12:06:47,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:06:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 759 transitions. [2018-11-23 12:06:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-23 12:06:47,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:47,869 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 12:06:47,869 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:47,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:47,869 INFO L82 PathProgramCache]: Analyzing trace with hash 940765616, now seen corresponding path program 6 times [2018-11-23 12:06:47,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:47,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:47,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:47,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:47,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:48,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {15516#true} call ULTIMATE.init(); {15516#true} is VALID [2018-11-23 12:06:48,166 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 12:06:48,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {15516#true} assume true; {15516#true} is VALID [2018-11-23 12:06:48,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15516#true} {15516#true} #79#return; {15516#true} is VALID [2018-11-23 12:06:48,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {15516#true} call #t~ret7 := main(); {15516#true} is VALID [2018-11-23 12:06:48,186 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 12:06:48,186 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 12:06:48,187 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 12:06:48,187 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 12:06:48,188 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 12:06:48,188 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 12:06:48,188 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 12:06:48,189 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 12:06:48,189 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 12:06:48,190 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 12:06:48,190 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 12:06:48,190 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 12:06:48,191 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 12:06:48,192 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 12:06:48,192 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 12:06:48,193 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 12:06:48,193 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 12:06:48,194 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 12:06:48,195 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 12:06:48,195 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 12:06:48,196 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 12:06:48,196 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 12:06:48,197 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 12:06:48,198 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 12:06:48,198 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 12:06:48,199 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 12:06:48,199 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 12:06:48,200 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 12:06:48,201 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 12:06:48,201 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 12:06:48,202 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 12:06:48,202 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 12:06:48,203 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 12:06:48,204 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 12:06:48,204 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 12:06:48,205 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 12:06:48,205 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 12:06:48,206 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 12:06:48,207 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 12:06:48,207 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 12:06:48,227 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 12:06:48,228 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 12:06:48,229 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 12:06:48,229 INFO L273 TraceCheckUtils]: 48: Hoare triple {15532#(<= main_~i~0 14)} assume !(~i~0 < 100000); {15517#false} is VALID [2018-11-23 12:06:48,229 INFO L273 TraceCheckUtils]: 49: Hoare triple {15517#false} ~f~0 := 1;~i~0 := 0; {15517#false} is VALID [2018-11-23 12:06:48,229 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 12:06:48,229 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 12:06:48,230 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 12:06:48,230 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 12:06:48,230 INFO L273 TraceCheckUtils]: 54: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,230 INFO L273 TraceCheckUtils]: 55: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,230 INFO L273 TraceCheckUtils]: 56: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,230 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 12:06:48,230 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 12:06:48,230 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 12:06:48,230 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 12:06:48,231 INFO L273 TraceCheckUtils]: 61: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,231 INFO L273 TraceCheckUtils]: 62: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,231 INFO L273 TraceCheckUtils]: 63: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,231 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 12:06:48,231 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 12:06:48,231 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 12:06:48,231 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 12:06:48,232 INFO L273 TraceCheckUtils]: 68: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,232 INFO L273 TraceCheckUtils]: 69: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,232 INFO L273 TraceCheckUtils]: 70: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,232 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 12:06:48,232 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 12:06:48,233 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 12:06:48,233 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 12:06:48,233 INFO L273 TraceCheckUtils]: 75: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,233 INFO L273 TraceCheckUtils]: 76: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,233 INFO L273 TraceCheckUtils]: 77: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,234 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 12:06:48,234 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 12:06:48,234 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 12:06:48,234 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 12:06:48,234 INFO L273 TraceCheckUtils]: 82: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,234 INFO L273 TraceCheckUtils]: 83: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,234 INFO L273 TraceCheckUtils]: 84: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,235 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 12:06:48,235 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 12:06:48,235 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 12:06:48,235 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 12:06:48,235 INFO L273 TraceCheckUtils]: 89: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,235 INFO L273 TraceCheckUtils]: 90: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,235 INFO L273 TraceCheckUtils]: 91: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,235 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 12:06:48,236 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 12:06:48,236 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 12:06:48,236 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 12:06:48,236 INFO L273 TraceCheckUtils]: 96: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,236 INFO L273 TraceCheckUtils]: 97: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,236 INFO L273 TraceCheckUtils]: 98: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,236 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 12:06:48,236 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 12:06:48,236 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 12:06:48,237 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 12:06:48,237 INFO L273 TraceCheckUtils]: 103: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,237 INFO L273 TraceCheckUtils]: 104: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,237 INFO L273 TraceCheckUtils]: 105: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,237 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 12:06:48,237 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 12:06:48,237 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 12:06:48,237 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 12:06:48,237 INFO L273 TraceCheckUtils]: 110: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,238 INFO L273 TraceCheckUtils]: 111: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,238 INFO L273 TraceCheckUtils]: 112: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,238 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 12:06:48,238 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 12:06:48,238 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 12:06:48,238 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 12:06:48,238 INFO L273 TraceCheckUtils]: 117: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,238 INFO L273 TraceCheckUtils]: 118: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,239 INFO L273 TraceCheckUtils]: 119: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,239 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 12:06:48,239 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 12:06:48,239 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 12:06:48,239 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 12:06:48,239 INFO L273 TraceCheckUtils]: 124: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,239 INFO L273 TraceCheckUtils]: 125: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,239 INFO L273 TraceCheckUtils]: 126: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,239 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 12:06:48,240 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 12:06:48,240 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 12:06:48,240 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 12:06:48,240 INFO L273 TraceCheckUtils]: 131: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,240 INFO L273 TraceCheckUtils]: 132: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,240 INFO L273 TraceCheckUtils]: 133: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,240 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 12:06:48,240 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 12:06:48,240 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 12:06:48,241 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 12:06:48,241 INFO L273 TraceCheckUtils]: 138: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,241 INFO L273 TraceCheckUtils]: 139: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,241 INFO L273 TraceCheckUtils]: 140: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,241 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 12:06:48,241 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 12:06:48,241 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 12:06:48,241 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 12:06:48,241 INFO L273 TraceCheckUtils]: 145: Hoare triple {15517#false} assume !#t~short6; {15517#false} is VALID [2018-11-23 12:06:48,242 INFO L273 TraceCheckUtils]: 146: Hoare triple {15517#false} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15517#false} is VALID [2018-11-23 12:06:48,242 INFO L273 TraceCheckUtils]: 147: Hoare triple {15517#false} ~i~0 := 1 + ~i~0; {15517#false} is VALID [2018-11-23 12:06:48,242 INFO L273 TraceCheckUtils]: 148: Hoare triple {15517#false} assume !(~i~0 < 100000); {15517#false} is VALID [2018-11-23 12:06:48,242 INFO L256 TraceCheckUtils]: 149: Hoare triple {15517#false} call __VERIFIER_assert(~f~0); {15517#false} is VALID [2018-11-23 12:06:48,242 INFO L273 TraceCheckUtils]: 150: Hoare triple {15517#false} ~cond := #in~cond; {15517#false} is VALID [2018-11-23 12:06:48,242 INFO L273 TraceCheckUtils]: 151: Hoare triple {15517#false} assume 0 == ~cond; {15517#false} is VALID [2018-11-23 12:06:48,242 INFO L273 TraceCheckUtils]: 152: Hoare triple {15517#false} assume !false; {15517#false} is VALID [2018-11-23 12:06:48,251 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 12:06:48,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:48,251 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 12:06:48,260 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:48,328 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:06:48,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:48,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:48,424 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 12:06:48,428 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 12:06:48,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:48,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:48,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:48,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 12:06:48,489 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 12:06:48,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:48,499 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 12:06:48,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:48,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:48,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:48,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 12:06:48,613 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 12:06:48,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:48,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:48,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:48,622 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 12:06:48,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:48,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:48,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:48,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2018-11-23 12:06:54,837 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 12:06:54,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:54,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:54,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:54,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:54,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:54,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:54,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:54,862 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 12:06:54,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:54,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:54,919 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 12:06:54,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:54,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:54,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:54,954 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 12:06:54,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 12:06:54,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:55,017 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 12:06:55,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:111, output treesize:26 [2018-11-23 12:06:55,020 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:55,021 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 12:06:55,021 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 12:06:55,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {15516#true} call ULTIMATE.init(); {15516#true} is VALID [2018-11-23 12:06:55,236 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 12:06:55,236 INFO L273 TraceCheckUtils]: 2: Hoare triple {15516#true} assume true; {15516#true} is VALID [2018-11-23 12:06:55,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15516#true} {15516#true} #79#return; {15516#true} is VALID [2018-11-23 12:06:55,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {15516#true} call #t~ret7 := main(); {15516#true} is VALID [2018-11-23 12:06:55,237 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 12:06:55,237 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 12:06:55,237 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 12:06:55,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 12:06:55,238 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 12:06:55,238 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 12:06:55,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 12:06:55,238 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 12:06:55,238 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 12:06:55,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 12:06:55,238 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 12:06:55,238 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 12:06:55,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 12:06:55,239 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 12:06:55,239 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 12:06:55,239 INFO L273 TraceCheckUtils]: 20: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 12:06:55,239 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 12:06:55,239 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 12:06:55,239 INFO L273 TraceCheckUtils]: 23: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 12:06:55,239 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 12:06:55,239 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 12:06:55,240 INFO L273 TraceCheckUtils]: 26: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 12:06:55,240 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 12:06:55,240 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 12:06:55,240 INFO L273 TraceCheckUtils]: 29: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 12:06:55,240 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 12:06:55,240 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 12:06:55,241 INFO L273 TraceCheckUtils]: 32: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 12:06:55,241 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 12:06:55,241 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 12:06:55,241 INFO L273 TraceCheckUtils]: 35: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 12:06:55,241 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 12:06:55,241 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 12:06:55,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {15516#true} ~i~0 := 1 + ~i~0; {15516#true} is VALID [2018-11-23 12:06:55,241 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 12:06:55,244 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 12:06:55,245 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 12:06:55,245 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 12:06:55,246 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 12:06:55,246 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 12:06:55,247 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 12:06:55,249 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 12:06:55,252 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 12:06:55,254 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 12:06:55,254 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 12:06:55,255 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 12:06:55,256 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 12:06:55,256 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 12:06:55,257 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 12:06:55,257 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 12:06:55,258 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~mem5;havoc #t~mem4;havoc #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 12:06:55,258 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 12:06:55,259 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 12:06:55,259 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 12:06:55,260 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 12:06:55,261 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 12:06:55,261 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 12:06:55,262 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~mem5;havoc #t~mem4;havoc #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 12:06:55,262 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 12:06:55,263 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 12:06:55,263 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 12:06:55,264 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 12:06:55,264 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 12:06:55,265 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 12:06:55,265 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~mem5;havoc #t~mem4;havoc #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 12:06:55,266 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 12:06:55,266 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 12:06:55,267 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 12:06:55,268 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 12:06:55,285 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 12:06:55,294 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 12:06:55,298 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~mem5;havoc #t~mem4;havoc #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 12:06:55,298 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 12:06:55,298 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 12:06:55,299 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 12:06:55,299 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 12:06:55,300 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 12:06:55,300 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 12:06:55,300 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~mem5;havoc #t~mem4;havoc #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 12:06:55,301 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 12:06:55,301 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 12:06:55,301 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 12:06:55,302 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 12:06:55,302 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 12:06:55,303 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 12:06:55,304 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~mem5;havoc #t~mem4;havoc #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 12:06:55,304 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 12:06:55,305 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 12:06:55,305 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 12:06:55,306 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 12:06:55,306 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 12:06:55,307 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 12:06:55,308 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~mem5;havoc #t~mem4;havoc #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 12:06:55,308 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 12:06:55,309 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 12:06:55,309 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 12:06:55,310 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 12:06:55,310 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 12:06:55,311 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 12:06:55,312 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~mem5;havoc #t~mem4;havoc #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 12:06:55,312 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 12:06:55,313 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 12:06:55,313 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 12:06:55,314 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 12:06:55,314 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 12:06:55,315 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 12:06:55,316 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~mem5;havoc #t~mem4;havoc #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 12:06:55,316 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 12:06:55,317 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 12:06:55,317 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 12:06:55,318 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 12:06:55,318 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 12:06:55,319 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 12:06:55,320 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~mem5;havoc #t~mem4;havoc #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 12:06:55,320 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 12:06:55,321 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 12:06:55,321 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 12:06:55,322 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 12:06:55,322 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 12:06:55,323 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 12:06:55,324 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~mem5;havoc #t~mem4;havoc #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 12:06:55,324 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 12:06:55,325 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 12:06:55,327 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 12:06:55,327 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 12:06:55,328 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 12:06:55,328 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 12:06:55,329 INFO L273 TraceCheckUtils]: 132: Hoare triple {15932#(or (<= 100000 main_~i~0) (<= main_~i~0 99996))} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15932#(or (<= 100000 main_~i~0) (<= main_~i~0 99996))} is VALID [2018-11-23 12:06:55,330 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 12:06:55,330 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 12:06:55,331 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 12:06:55,332 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 12:06:55,332 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 12:06:55,333 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 12:06:55,333 INFO L273 TraceCheckUtils]: 139: Hoare triple {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15945#(or (<= 100001 main_~i~0) (<= main_~i~0 99997))} is VALID [2018-11-23 12:06:55,334 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 12:06:55,335 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 12:06:55,335 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 12:06:55,336 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 12:06:55,337 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 12:06:55,337 INFO L273 TraceCheckUtils]: 145: Hoare triple {15971#(<= main_~i~0 99998)} assume !#t~short6; {15971#(<= main_~i~0 99998)} is VALID [2018-11-23 12:06:55,338 INFO L273 TraceCheckUtils]: 146: Hoare triple {15971#(<= main_~i~0 99998)} assume !#t~short6;havoc #t~mem5;havoc #t~mem4;havoc #t~short6; {15971#(<= main_~i~0 99998)} is VALID [2018-11-23 12:06:55,338 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 12:06:55,339 INFO L273 TraceCheckUtils]: 148: Hoare triple {15990#(<= main_~i~0 99999)} assume !(~i~0 < 100000); {15517#false} is VALID [2018-11-23 12:06:55,339 INFO L256 TraceCheckUtils]: 149: Hoare triple {15517#false} call __VERIFIER_assert(~f~0); {15517#false} is VALID [2018-11-23 12:06:55,339 INFO L273 TraceCheckUtils]: 150: Hoare triple {15517#false} ~cond := #in~cond; {15517#false} is VALID [2018-11-23 12:06:55,340 INFO L273 TraceCheckUtils]: 151: Hoare triple {15517#false} assume 0 == ~cond; {15517#false} is VALID [2018-11-23 12:06:55,340 INFO L273 TraceCheckUtils]: 152: Hoare triple {15517#false} assume !false; {15517#false} is VALID [2018-11-23 12:06:55,429 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 12:06:55,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:55,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2018-11-23 12:06:55,448 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 153 [2018-11-23 12:06:55,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:55,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:06:55,586 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 12:06:55,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:06:55,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:06:55,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=658, Unknown=2, NotChecked=0, Total=930 [2018-11-23 12:06:55,589 INFO L87 Difference]: Start difference. First operand 529 states and 759 transitions. Second operand 31 states. [2018-11-23 12:07:16,046 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-23 12:07:38,928 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-23 12:08:01,456 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-23 12:08:21,366 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-23 12:08:46,391 WARN L180 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-23 12:09:12,015 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-23 12:09:27,603 WARN L180 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 37 DAG size of output: 36