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_two_index_08_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:09:20,226 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:09:20,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:09:20,246 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:09:20,247 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:09:20,248 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:09:20,249 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:09:20,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:09:20,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:09:20,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:09:20,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:09:20,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:09:20,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:09:20,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:09:20,259 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:09:20,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:09:20,260 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:09:20,262 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:09:20,265 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:09:20,266 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:09:20,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:09:20,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:09:20,272 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:09:20,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:09:20,272 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:09:20,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:09:20,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:09:20,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:09:20,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:09:20,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:09:20,278 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:09:20,279 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:09:20,279 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:09:20,279 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:09:20,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:09:20,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:09:20,281 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:09:20,297 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:09:20,297 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:09:20,298 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:09:20,299 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:09:20,299 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:09:20,300 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:09:20,300 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:09:20,300 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:09:20,300 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:09:20,301 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:09:20,301 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:09:20,301 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:09:20,301 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:09:20,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:09:20,302 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:09:20,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:09:20,302 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:09:20,302 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:09:20,302 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:09:20,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:09:20,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:09:20,303 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:09:20,303 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:09:20,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:09:20,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:09:20,304 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:09:20,304 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:09:20,304 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:09:20,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:09:20,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:09:20,305 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:09:20,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:09:20,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:09:20,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:09:20,371 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:09:20,372 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:09:20,372 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_08_true-unreach-call.i [2018-11-23 12:09:20,441 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42d792e0e/5085ef0e9e7a4a0ebfa62b48b6ad9c8a/FLAG1bb87bddf [2018-11-23 12:09:20,882 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:09:20,885 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_08_true-unreach-call.i [2018-11-23 12:09:20,892 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42d792e0e/5085ef0e9e7a4a0ebfa62b48b6ad9c8a/FLAG1bb87bddf [2018-11-23 12:09:21,269 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42d792e0e/5085ef0e9e7a4a0ebfa62b48b6ad9c8a [2018-11-23 12:09:21,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:09:21,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:09:21,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:09:21,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:09:21,286 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:09:21,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:09:21" (1/1) ... [2018-11-23 12:09:21,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275e0492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:21, skipping insertion in model container [2018-11-23 12:09:21,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:09:21" (1/1) ... [2018-11-23 12:09:21,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:09:21,324 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:09:21,548 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:09:21,553 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:09:21,579 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:09:21,603 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:09:21,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:21 WrapperNode [2018-11-23 12:09:21,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:09:21,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:09:21,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:09:21,605 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:09:21,614 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:09:21" (1/1) ... [2018-11-23 12:09:21,623 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:09:21" (1/1) ... [2018-11-23 12:09:21,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:09:21,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:09:21,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:09:21,632 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:09:21,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:21" (1/1) ... [2018-11-23 12:09:21,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:21" (1/1) ... [2018-11-23 12:09:21,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:21" (1/1) ... [2018-11-23 12:09:21,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:21" (1/1) ... [2018-11-23 12:09:21,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:21" (1/1) ... [2018-11-23 12:09:21,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:21" (1/1) ... [2018-11-23 12:09:21,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:21" (1/1) ... [2018-11-23 12:09:21,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:09:21,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:09:21,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:09:21,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:09:21,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:21" (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:09:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:09:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:09:21,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:09:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:09:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:09:21,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:09:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:09:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:09:21,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:09:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:09:21,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:09:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:09:22,280 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:09:22,280 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:09:22,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:22 BoogieIcfgContainer [2018-11-23 12:09:22,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:09:22,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:09:22,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:09:22,286 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:09:22,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:09:21" (1/3) ... [2018-11-23 12:09:22,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f657c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:09:22, skipping insertion in model container [2018-11-23 12:09:22,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:21" (2/3) ... [2018-11-23 12:09:22,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f657c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:09:22, skipping insertion in model container [2018-11-23 12:09:22,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:22" (3/3) ... [2018-11-23 12:09:22,291 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_08_true-unreach-call.i [2018-11-23 12:09:22,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:09:22,308 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:09:22,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:09:22,360 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:09:22,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:09:22,361 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:09:22,361 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:09:22,362 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:09:22,362 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:09:22,362 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:09:22,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:09:22,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:09:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 12:09:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:09:22,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:22,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:22,390 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:22,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:22,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2018-11-23 12:09:22,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:22,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:22,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:22,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:22,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:22,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 12:09:22,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-23 12:09:22,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 12:09:22,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2018-11-23 12:09:22,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2018-11-23 12:09:22,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {27#true} is VALID [2018-11-23 12:09:22,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 12:09:22,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 1; {28#false} is VALID [2018-11-23 12:09:22,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !(~i~0 < 100000); {28#false} is VALID [2018-11-23 12:09:22,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} ~i~0 := 1;~j~0 := 0; {28#false} is VALID [2018-11-23 12:09:22,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {28#false} is VALID [2018-11-23 12:09:22,549 INFO L256 TraceCheckUtils]: 11: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {28#false} is VALID [2018-11-23 12:09:22,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 12:09:22,550 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-23 12:09:22,550 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 12:09:22,553 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:09:22,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:22,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:09:22,561 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:09:22,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:22,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:09:22,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:22,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:09:22,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:09:22,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:09:22,656 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 12:09:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:23,031 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-11-23 12:09:23,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:09:23,031 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:09:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:09:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:09:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:09:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:09:23,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 12:09:23,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:23,426 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:09:23,426 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 12:09:23,430 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:09:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 12:09:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 12:09:23,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:23,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 12:09:23,502 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:09:23,502 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:09:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:23,505 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 12:09:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:09:23,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:23,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:23,506 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:09:23,507 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:09:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:23,510 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 12:09:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:09:23,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:23,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:23,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:23,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:09:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 12:09:23,515 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-23 12:09:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:23,515 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 12:09:23,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:09:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:09:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:09:23,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:23,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:23,517 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:23,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2018-11-23 12:09:23,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:23,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:23,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:23,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:23,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2018-11-23 12:09:23,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {151#true} is VALID [2018-11-23 12:09:23,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {151#true} assume true; {151#true} is VALID [2018-11-23 12:09:23,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {151#true} {151#true} #60#return; {151#true} is VALID [2018-11-23 12:09:23,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {151#true} call #t~ret4 := main(); {151#true} is VALID [2018-11-23 12:09:23,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {151#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {153#(= main_~i~0 0)} is VALID [2018-11-23 12:09:23,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {153#(= main_~i~0 0)} assume !(~i~0 < 100000); {152#false} is VALID [2018-11-23 12:09:23,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {152#false} ~i~0 := 1; {152#false} is VALID [2018-11-23 12:09:23,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {152#false} assume !(~i~0 < 100000); {152#false} is VALID [2018-11-23 12:09:23,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {152#false} ~i~0 := 1;~j~0 := 0; {152#false} is VALID [2018-11-23 12:09:23,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {152#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {152#false} is VALID [2018-11-23 12:09:23,587 INFO L256 TraceCheckUtils]: 11: Hoare triple {152#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {152#false} is VALID [2018-11-23 12:09:23,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {152#false} ~cond := #in~cond; {152#false} is VALID [2018-11-23 12:09:23,588 INFO L273 TraceCheckUtils]: 13: Hoare triple {152#false} assume 0 == ~cond; {152#false} is VALID [2018-11-23 12:09:23,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {152#false} assume !false; {152#false} is VALID [2018-11-23 12:09:23,590 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:09:23,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:23,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:09:23,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:09:23,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:23,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:09:23,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:23,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:09:23,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:09:23,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:23,719 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-23 12:09:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:23,836 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:09:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:09:23,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:09:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:09:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:09:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:09:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:09:23,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 12:09:23,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:23,917 INFO L225 Difference]: With dead ends: 32 [2018-11-23 12:09:23,917 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:09:23,918 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:09:23,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:09:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:09:23,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:23,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:09:23,932 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:09:23,932 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:09:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:23,935 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:09:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:09:23,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:23,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:23,936 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:09:23,936 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:09:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:23,939 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:09:23,939 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:09:23,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:23,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:23,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:23,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:09:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 12:09:23,942 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2018-11-23 12:09:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:23,942 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 12:09:23,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:09:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:09:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:09:23,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:23,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:23,944 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:23,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:23,944 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2018-11-23 12:09:23,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:23,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:23,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:23,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:23,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:24,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {272#true} call ULTIMATE.init(); {272#true} is VALID [2018-11-23 12:09:24,099 INFO L273 TraceCheckUtils]: 1: Hoare triple {272#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {272#true} is VALID [2018-11-23 12:09:24,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {272#true} assume true; {272#true} is VALID [2018-11-23 12:09:24,100 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {272#true} {272#true} #60#return; {272#true} is VALID [2018-11-23 12:09:24,100 INFO L256 TraceCheckUtils]: 4: Hoare triple {272#true} call #t~ret4 := main(); {272#true} is VALID [2018-11-23 12:09:24,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {272#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {272#true} is VALID [2018-11-23 12:09:24,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {272#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {272#true} is VALID [2018-11-23 12:09:24,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {272#true} assume !(~i~0 < 100000); {272#true} is VALID [2018-11-23 12:09:24,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {272#true} ~i~0 := 1; {274#(= main_~i~0 1)} is VALID [2018-11-23 12:09:24,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {274#(= main_~i~0 1)} assume !(~i~0 < 100000); {273#false} is VALID [2018-11-23 12:09:24,130 INFO L273 TraceCheckUtils]: 10: Hoare triple {273#false} ~i~0 := 1;~j~0 := 0; {273#false} is VALID [2018-11-23 12:09:24,131 INFO L273 TraceCheckUtils]: 11: Hoare triple {273#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {273#false} is VALID [2018-11-23 12:09:24,131 INFO L256 TraceCheckUtils]: 12: Hoare triple {273#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {273#false} is VALID [2018-11-23 12:09:24,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {273#false} ~cond := #in~cond; {273#false} is VALID [2018-11-23 12:09:24,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {273#false} assume 0 == ~cond; {273#false} is VALID [2018-11-23 12:09:24,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {273#false} assume !false; {273#false} is VALID [2018-11-23 12:09:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:09:24,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:24,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:09:24,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:09:24,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:24,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:09:24,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:24,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:09:24,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:09:24,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:24,338 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 12:09:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:24,498 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:09:24,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:09:24,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:09:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:09:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2018-11-23 12:09:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:09:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2018-11-23 12:09:24,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2018-11-23 12:09:24,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:24,722 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:09:24,722 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:09:24,723 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:09:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:09:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-23 12:09:24,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:24,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 21 states. [2018-11-23 12:09:24,778 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 21 states. [2018-11-23 12:09:24,778 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 21 states. [2018-11-23 12:09:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:24,782 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:09:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:09:24,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:24,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:24,783 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 24 states. [2018-11-23 12:09:24,783 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 24 states. [2018-11-23 12:09:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:24,786 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:09:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:09:24,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:24,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:24,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:24,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:09:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 12:09:24,789 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2018-11-23 12:09:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:24,789 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 12:09:24,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:09:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:09:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:09:24,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:24,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:24,791 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:24,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:24,792 INFO L82 PathProgramCache]: Analyzing trace with hash -59429947, now seen corresponding path program 1 times [2018-11-23 12:09:24,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:24,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:24,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:24,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:24,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:24,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2018-11-23 12:09:24,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {407#true} is VALID [2018-11-23 12:09:24,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-23 12:09:24,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #60#return; {407#true} is VALID [2018-11-23 12:09:24,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret4 := main(); {407#true} is VALID [2018-11-23 12:09:24,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {407#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {409#(= main_~i~0 0)} is VALID [2018-11-23 12:09:24,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {409#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {410#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:24,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {410#(<= main_~i~0 1)} assume !(~i~0 < 100000); {408#false} is VALID [2018-11-23 12:09:24,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {408#false} ~i~0 := 1; {408#false} is VALID [2018-11-23 12:09:24,894 INFO L273 TraceCheckUtils]: 9: Hoare triple {408#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {408#false} is VALID [2018-11-23 12:09:24,894 INFO L273 TraceCheckUtils]: 10: Hoare triple {408#false} assume !(~i~0 < 100000); {408#false} is VALID [2018-11-23 12:09:24,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {408#false} ~i~0 := 1;~j~0 := 0; {408#false} is VALID [2018-11-23 12:09:24,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {408#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {408#false} is VALID [2018-11-23 12:09:24,895 INFO L256 TraceCheckUtils]: 13: Hoare triple {408#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {408#false} is VALID [2018-11-23 12:09:24,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {408#false} ~cond := #in~cond; {408#false} is VALID [2018-11-23 12:09:24,896 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#false} assume 0 == ~cond; {408#false} is VALID [2018-11-23 12:09:24,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {408#false} assume !false; {408#false} is VALID [2018-11-23 12:09:24,897 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:09:24,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:24,898 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:09:24,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:24,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:25,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2018-11-23 12:09:25,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {407#true} is VALID [2018-11-23 12:09:25,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-23 12:09:25,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #60#return; {407#true} is VALID [2018-11-23 12:09:25,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret4 := main(); {407#true} is VALID [2018-11-23 12:09:25,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {407#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {429#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:25,224 INFO L273 TraceCheckUtils]: 6: Hoare triple {429#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {410#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:25,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {410#(<= main_~i~0 1)} assume !(~i~0 < 100000); {408#false} is VALID [2018-11-23 12:09:25,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {408#false} ~i~0 := 1; {408#false} is VALID [2018-11-23 12:09:25,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {408#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {408#false} is VALID [2018-11-23 12:09:25,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {408#false} assume !(~i~0 < 100000); {408#false} is VALID [2018-11-23 12:09:25,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {408#false} ~i~0 := 1;~j~0 := 0; {408#false} is VALID [2018-11-23 12:09:25,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {408#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {408#false} is VALID [2018-11-23 12:09:25,227 INFO L256 TraceCheckUtils]: 13: Hoare triple {408#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {408#false} is VALID [2018-11-23 12:09:25,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {408#false} ~cond := #in~cond; {408#false} is VALID [2018-11-23 12:09:25,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#false} assume 0 == ~cond; {408#false} is VALID [2018-11-23 12:09:25,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {408#false} assume !false; {408#false} is VALID [2018-11-23 12:09:25,228 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:09:25,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:25,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:09:25,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:09:25,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:25,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:09:25,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:25,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:09:25,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:09:25,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:09:25,303 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-23 12:09:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:25,631 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 12:09:25,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:09:25,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:09:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:09:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 12:09:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:09:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 12:09:25,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2018-11-23 12:09:25,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:25,737 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:09:25,738 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:09:25,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:09:25,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:09:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-11-23 12:09:25,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:25,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 22 states. [2018-11-23 12:09:25,773 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 22 states. [2018-11-23 12:09:25,773 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 22 states. [2018-11-23 12:09:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:25,775 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:09:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:09:25,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:25,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:25,777 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 25 states. [2018-11-23 12:09:25,777 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 25 states. [2018-11-23 12:09:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:25,780 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:09:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:09:25,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:25,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:25,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:25,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:09:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 12:09:25,783 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2018-11-23 12:09:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:25,784 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 12:09:25,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:09:25,784 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 12:09:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:09:25,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:25,785 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:25,785 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:25,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:25,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1302144745, now seen corresponding path program 2 times [2018-11-23 12:09:25,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:25,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:25,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:25,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:25,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:25,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2018-11-23 12:09:25,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {603#true} is VALID [2018-11-23 12:09:25,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 12:09:25,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #60#return; {603#true} is VALID [2018-11-23 12:09:25,904 INFO L256 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret4 := main(); {603#true} is VALID [2018-11-23 12:09:25,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {603#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {605#(= main_~i~0 0)} is VALID [2018-11-23 12:09:25,914 INFO L273 TraceCheckUtils]: 6: Hoare triple {605#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {606#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:25,915 INFO L273 TraceCheckUtils]: 7: Hoare triple {606#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {607#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:25,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {607#(<= main_~i~0 2)} assume !(~i~0 < 100000); {604#false} is VALID [2018-11-23 12:09:25,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {604#false} ~i~0 := 1; {604#false} is VALID [2018-11-23 12:09:25,921 INFO L273 TraceCheckUtils]: 10: Hoare triple {604#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {604#false} is VALID [2018-11-23 12:09:25,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {604#false} assume !(~i~0 < 100000); {604#false} is VALID [2018-11-23 12:09:25,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {604#false} ~i~0 := 1;~j~0 := 0; {604#false} is VALID [2018-11-23 12:09:25,921 INFO L273 TraceCheckUtils]: 13: Hoare triple {604#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {604#false} is VALID [2018-11-23 12:09:25,921 INFO L256 TraceCheckUtils]: 14: Hoare triple {604#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {604#false} is VALID [2018-11-23 12:09:25,922 INFO L273 TraceCheckUtils]: 15: Hoare triple {604#false} ~cond := #in~cond; {604#false} is VALID [2018-11-23 12:09:25,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {604#false} assume 0 == ~cond; {604#false} is VALID [2018-11-23 12:09:25,922 INFO L273 TraceCheckUtils]: 17: Hoare triple {604#false} assume !false; {604#false} is VALID [2018-11-23 12:09:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:09:25,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:25,923 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:09:25,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:09:25,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:09:25,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:25,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:26,078 INFO L256 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2018-11-23 12:09:26,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {603#true} is VALID [2018-11-23 12:09:26,079 INFO L273 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 12:09:26,079 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #60#return; {603#true} is VALID [2018-11-23 12:09:26,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret4 := main(); {603#true} is VALID [2018-11-23 12:09:26,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {603#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {626#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:26,082 INFO L273 TraceCheckUtils]: 6: Hoare triple {626#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {606#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:26,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {606#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {607#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:26,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {607#(<= main_~i~0 2)} assume !(~i~0 < 100000); {604#false} is VALID [2018-11-23 12:09:26,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {604#false} ~i~0 := 1; {604#false} is VALID [2018-11-23 12:09:26,088 INFO L273 TraceCheckUtils]: 10: Hoare triple {604#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {604#false} is VALID [2018-11-23 12:09:26,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {604#false} assume !(~i~0 < 100000); {604#false} is VALID [2018-11-23 12:09:26,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {604#false} ~i~0 := 1;~j~0 := 0; {604#false} is VALID [2018-11-23 12:09:26,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {604#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {604#false} is VALID [2018-11-23 12:09:26,089 INFO L256 TraceCheckUtils]: 14: Hoare triple {604#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {604#false} is VALID [2018-11-23 12:09:26,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {604#false} ~cond := #in~cond; {604#false} is VALID [2018-11-23 12:09:26,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {604#false} assume 0 == ~cond; {604#false} is VALID [2018-11-23 12:09:26,090 INFO L273 TraceCheckUtils]: 17: Hoare triple {604#false} assume !false; {604#false} is VALID [2018-11-23 12:09:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:09:26,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:26,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:09:26,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 12:09:26,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:26,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:09:26,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:26,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:09:26,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:09:26,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:09:26,138 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2018-11-23 12:09:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:26,400 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 12:09:26,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:09:26,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 12:09:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:09:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-23 12:09:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:09:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-23 12:09:26,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2018-11-23 12:09:26,478 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:09:26,480 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:09:26,480 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:09:26,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:09:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:09:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-11-23 12:09:26,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:26,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 23 states. [2018-11-23 12:09:26,504 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 23 states. [2018-11-23 12:09:26,504 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 23 states. [2018-11-23 12:09:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:26,506 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 12:09:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:09:26,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:26,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:26,508 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 26 states. [2018-11-23 12:09:26,508 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 26 states. [2018-11-23 12:09:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:26,510 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 12:09:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:09:26,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:26,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:26,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:26,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:09:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 12:09:26,513 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2018-11-23 12:09:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:26,513 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 12:09:26,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:09:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 12:09:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:09:26,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:26,514 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:26,515 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:26,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:26,515 INFO L82 PathProgramCache]: Analyzing trace with hash 561287237, now seen corresponding path program 3 times [2018-11-23 12:09:26,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:26,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:26,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:26,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:26,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:26,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {809#true} is VALID [2018-11-23 12:09:26,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {809#true} is VALID [2018-11-23 12:09:26,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {809#true} assume true; {809#true} is VALID [2018-11-23 12:09:26,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} #60#return; {809#true} is VALID [2018-11-23 12:09:26,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {809#true} call #t~ret4 := main(); {809#true} is VALID [2018-11-23 12:09:26,670 INFO L273 TraceCheckUtils]: 5: Hoare triple {809#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {811#(= main_~i~0 0)} is VALID [2018-11-23 12:09:26,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {811#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {812#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:26,674 INFO L273 TraceCheckUtils]: 7: Hoare triple {812#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {813#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:26,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {813#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {814#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:26,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {814#(<= main_~i~0 3)} assume !(~i~0 < 100000); {810#false} is VALID [2018-11-23 12:09:26,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {810#false} ~i~0 := 1; {810#false} is VALID [2018-11-23 12:09:26,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {810#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {810#false} is VALID [2018-11-23 12:09:26,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {810#false} assume !(~i~0 < 100000); {810#false} is VALID [2018-11-23 12:09:26,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {810#false} ~i~0 := 1;~j~0 := 0; {810#false} is VALID [2018-11-23 12:09:26,680 INFO L273 TraceCheckUtils]: 14: Hoare triple {810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {810#false} is VALID [2018-11-23 12:09:26,680 INFO L256 TraceCheckUtils]: 15: Hoare triple {810#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {810#false} is VALID [2018-11-23 12:09:26,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {810#false} ~cond := #in~cond; {810#false} is VALID [2018-11-23 12:09:26,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {810#false} assume 0 == ~cond; {810#false} is VALID [2018-11-23 12:09:26,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {810#false} assume !false; {810#false} is VALID [2018-11-23 12:09:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:09:26,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:26,682 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:09:26,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:09:26,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:09:26,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:26,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:26,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {809#true} is VALID [2018-11-23 12:09:26,775 INFO L273 TraceCheckUtils]: 1: Hoare triple {809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {809#true} is VALID [2018-11-23 12:09:26,775 INFO L273 TraceCheckUtils]: 2: Hoare triple {809#true} assume true; {809#true} is VALID [2018-11-23 12:09:26,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} #60#return; {809#true} is VALID [2018-11-23 12:09:26,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {809#true} call #t~ret4 := main(); {809#true} is VALID [2018-11-23 12:09:26,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {809#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {809#true} is VALID [2018-11-23 12:09:26,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {809#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {809#true} is VALID [2018-11-23 12:09:26,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {809#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {809#true} is VALID [2018-11-23 12:09:26,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {809#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {809#true} is VALID [2018-11-23 12:09:26,777 INFO L273 TraceCheckUtils]: 9: Hoare triple {809#true} assume !(~i~0 < 100000); {809#true} is VALID [2018-11-23 12:09:26,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {809#true} ~i~0 := 1; {812#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:26,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {812#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {851#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:26,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {851#(<= main_~i~0 9)} assume !(~i~0 < 100000); {810#false} is VALID [2018-11-23 12:09:26,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {810#false} ~i~0 := 1;~j~0 := 0; {810#false} is VALID [2018-11-23 12:09:26,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {810#false} is VALID [2018-11-23 12:09:26,781 INFO L256 TraceCheckUtils]: 15: Hoare triple {810#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {810#false} is VALID [2018-11-23 12:09:26,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {810#false} ~cond := #in~cond; {810#false} is VALID [2018-11-23 12:09:26,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {810#false} assume 0 == ~cond; {810#false} is VALID [2018-11-23 12:09:26,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {810#false} assume !false; {810#false} is VALID [2018-11-23 12:09:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:09:26,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:26,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-11-23 12:09:26,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:09:26,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:26,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:09:26,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:26,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:09:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:09:26,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:09:26,842 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 7 states. [2018-11-23 12:09:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:27,030 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 12:09:27,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:09:27,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:09:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:09:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-23 12:09:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:09:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-23 12:09:27,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2018-11-23 12:09:27,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:27,192 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:09:27,192 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:09:27,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:09:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:09:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-11-23 12:09:27,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:27,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 26 states. [2018-11-23 12:09:27,219 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 26 states. [2018-11-23 12:09:27,219 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 26 states. [2018-11-23 12:09:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:27,222 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:09:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:09:27,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:27,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:27,223 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 32 states. [2018-11-23 12:09:27,223 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 32 states. [2018-11-23 12:09:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:27,225 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:09:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:09:27,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:27,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:27,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:27,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:09:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 12:09:27,228 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2018-11-23 12:09:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:27,229 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 12:09:27,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:09:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 12:09:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:09:27,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:27,230 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:27,230 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:27,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash 53593642, now seen corresponding path program 4 times [2018-11-23 12:09:27,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:27,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:27,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:27,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 12:09:27,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1048#true} is VALID [2018-11-23 12:09:27,436 INFO L273 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 12:09:27,436 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #60#return; {1048#true} is VALID [2018-11-23 12:09:27,437 INFO L256 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret4 := main(); {1048#true} is VALID [2018-11-23 12:09:27,437 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1050#(= main_~i~0 0)} is VALID [2018-11-23 12:09:27,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {1050#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1051#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:27,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {1051#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1052#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:27,447 INFO L273 TraceCheckUtils]: 8: Hoare triple {1052#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1053#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:27,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {1053#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1054#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:27,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {1054#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1055#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:27,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {1055#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1049#false} is VALID [2018-11-23 12:09:27,452 INFO L273 TraceCheckUtils]: 12: Hoare triple {1049#false} ~i~0 := 1; {1049#false} is VALID [2018-11-23 12:09:27,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1049#false} is VALID [2018-11-23 12:09:27,452 INFO L273 TraceCheckUtils]: 14: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1049#false} is VALID [2018-11-23 12:09:27,452 INFO L273 TraceCheckUtils]: 15: Hoare triple {1049#false} assume !(~i~0 < 100000); {1049#false} is VALID [2018-11-23 12:09:27,453 INFO L273 TraceCheckUtils]: 16: Hoare triple {1049#false} ~i~0 := 1;~j~0 := 0; {1049#false} is VALID [2018-11-23 12:09:27,453 INFO L273 TraceCheckUtils]: 17: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {1049#false} is VALID [2018-11-23 12:09:27,453 INFO L256 TraceCheckUtils]: 18: Hoare triple {1049#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1049#false} is VALID [2018-11-23 12:09:27,454 INFO L273 TraceCheckUtils]: 19: Hoare triple {1049#false} ~cond := #in~cond; {1049#false} is VALID [2018-11-23 12:09:27,454 INFO L273 TraceCheckUtils]: 20: Hoare triple {1049#false} assume 0 == ~cond; {1049#false} is VALID [2018-11-23 12:09:27,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 12:09:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:09:27,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:27,456 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:09:27,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:09:27,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:09:27,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:27,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:27,762 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 12:09:27,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1048#true} is VALID [2018-11-23 12:09:27,762 INFO L273 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 12:09:27,763 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #60#return; {1048#true} is VALID [2018-11-23 12:09:27,763 INFO L256 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret4 := main(); {1048#true} is VALID [2018-11-23 12:09:27,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1074#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:27,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {1074#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1051#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:27,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {1051#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1052#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:27,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {1052#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1053#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:27,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {1053#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1054#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:27,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {1054#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1055#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:27,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {1055#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1049#false} is VALID [2018-11-23 12:09:27,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {1049#false} ~i~0 := 1; {1049#false} is VALID [2018-11-23 12:09:27,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1049#false} is VALID [2018-11-23 12:09:27,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1049#false} is VALID [2018-11-23 12:09:27,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {1049#false} assume !(~i~0 < 100000); {1049#false} is VALID [2018-11-23 12:09:27,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {1049#false} ~i~0 := 1;~j~0 := 0; {1049#false} is VALID [2018-11-23 12:09:27,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {1049#false} is VALID [2018-11-23 12:09:27,777 INFO L256 TraceCheckUtils]: 18: Hoare triple {1049#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1049#false} is VALID [2018-11-23 12:09:27,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {1049#false} ~cond := #in~cond; {1049#false} is VALID [2018-11-23 12:09:27,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {1049#false} assume 0 == ~cond; {1049#false} is VALID [2018-11-23 12:09:27,778 INFO L273 TraceCheckUtils]: 21: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 12:09:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:09:27,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:27,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:09:27,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 12:09:27,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:27,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:09:27,865 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:09:27,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:09:27,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:09:27,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:09:27,867 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 9 states. [2018-11-23 12:09:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:28,243 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 12:09:28,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:09:28,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 12:09:28,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:09:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-23 12:09:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:09:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-23 12:09:28,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2018-11-23 12:09:28,302 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:09:28,303 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:09:28,304 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:09:28,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:09:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:09:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-23 12:09:28,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:28,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2018-11-23 12:09:28,338 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2018-11-23 12:09:28,339 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2018-11-23 12:09:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:28,341 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 12:09:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 12:09:28,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:28,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:28,342 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2018-11-23 12:09:28,342 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2018-11-23 12:09:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:28,344 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 12:09:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 12:09:28,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:28,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:28,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:28,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:09:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 12:09:28,347 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 22 [2018-11-23 12:09:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:28,348 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 12:09:28,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:09:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:09:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:09:28,349 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:28,349 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:28,349 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:28,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:28,350 INFO L82 PathProgramCache]: Analyzing trace with hash -532864634, now seen corresponding path program 5 times [2018-11-23 12:09:28,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:28,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:28,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:28,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:28,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:28,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {1295#true} call ULTIMATE.init(); {1295#true} is VALID [2018-11-23 12:09:28,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {1295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1295#true} is VALID [2018-11-23 12:09:28,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {1295#true} assume true; {1295#true} is VALID [2018-11-23 12:09:28,531 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1295#true} {1295#true} #60#return; {1295#true} is VALID [2018-11-23 12:09:28,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {1295#true} call #t~ret4 := main(); {1295#true} is VALID [2018-11-23 12:09:28,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {1295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1297#(= main_~i~0 0)} is VALID [2018-11-23 12:09:28,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {1297#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1298#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:28,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {1298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1299#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:28,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {1299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1300#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:28,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {1300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1301#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:28,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {1301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1302#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:28,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {1302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1303#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:28,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {1303#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1296#false} is VALID [2018-11-23 12:09:28,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {1296#false} ~i~0 := 1; {1296#false} is VALID [2018-11-23 12:09:28,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {1296#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1296#false} is VALID [2018-11-23 12:09:28,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {1296#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1296#false} is VALID [2018-11-23 12:09:28,547 INFO L273 TraceCheckUtils]: 16: Hoare triple {1296#false} assume !(~i~0 < 100000); {1296#false} is VALID [2018-11-23 12:09:28,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {1296#false} ~i~0 := 1;~j~0 := 0; {1296#false} is VALID [2018-11-23 12:09:28,548 INFO L273 TraceCheckUtils]: 18: Hoare triple {1296#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {1296#false} is VALID [2018-11-23 12:09:28,548 INFO L256 TraceCheckUtils]: 19: Hoare triple {1296#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1296#false} is VALID [2018-11-23 12:09:28,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {1296#false} ~cond := #in~cond; {1296#false} is VALID [2018-11-23 12:09:28,549 INFO L273 TraceCheckUtils]: 21: Hoare triple {1296#false} assume 0 == ~cond; {1296#false} is VALID [2018-11-23 12:09:28,549 INFO L273 TraceCheckUtils]: 22: Hoare triple {1296#false} assume !false; {1296#false} is VALID [2018-11-23 12:09:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:09:28,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:28,550 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:09:28,563 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:09:28,631 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:09:28,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:28,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:28,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {1295#true} call ULTIMATE.init(); {1295#true} is VALID [2018-11-23 12:09:28,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {1295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1295#true} is VALID [2018-11-23 12:09:28,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {1295#true} assume true; {1295#true} is VALID [2018-11-23 12:09:28,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1295#true} {1295#true} #60#return; {1295#true} is VALID [2018-11-23 12:09:28,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {1295#true} call #t~ret4 := main(); {1295#true} is VALID [2018-11-23 12:09:28,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {1295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1322#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:28,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {1322#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1298#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:28,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {1298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1299#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:28,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {1299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1300#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:28,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {1300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1301#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:28,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {1301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1302#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:28,806 INFO L273 TraceCheckUtils]: 11: Hoare triple {1302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1303#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:28,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {1303#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1296#false} is VALID [2018-11-23 12:09:28,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {1296#false} ~i~0 := 1; {1296#false} is VALID [2018-11-23 12:09:28,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {1296#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1296#false} is VALID [2018-11-23 12:09:28,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {1296#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1296#false} is VALID [2018-11-23 12:09:28,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {1296#false} assume !(~i~0 < 100000); {1296#false} is VALID [2018-11-23 12:09:28,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {1296#false} ~i~0 := 1;~j~0 := 0; {1296#false} is VALID [2018-11-23 12:09:28,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {1296#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {1296#false} is VALID [2018-11-23 12:09:28,809 INFO L256 TraceCheckUtils]: 19: Hoare triple {1296#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1296#false} is VALID [2018-11-23 12:09:28,809 INFO L273 TraceCheckUtils]: 20: Hoare triple {1296#false} ~cond := #in~cond; {1296#false} is VALID [2018-11-23 12:09:28,809 INFO L273 TraceCheckUtils]: 21: Hoare triple {1296#false} assume 0 == ~cond; {1296#false} is VALID [2018-11-23 12:09:28,810 INFO L273 TraceCheckUtils]: 22: Hoare triple {1296#false} assume !false; {1296#false} is VALID [2018-11-23 12:09:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:09:28,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:28,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:09:28,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 12:09:28,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:28,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:09:28,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:28,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:09:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:09:28,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:09:28,927 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 10 states. [2018-11-23 12:09:29,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:29,313 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-23 12:09:29,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:09:29,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 12:09:29,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:09:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2018-11-23 12:09:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:09:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2018-11-23 12:09:29,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 47 transitions. [2018-11-23 12:09:29,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:29,369 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:09:29,370 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:09:29,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:09:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:09:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-23 12:09:29,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:29,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2018-11-23 12:09:29,409 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2018-11-23 12:09:29,409 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2018-11-23 12:09:29,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:29,411 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 12:09:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 12:09:29,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:29,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:29,412 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2018-11-23 12:09:29,413 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2018-11-23 12:09:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:29,415 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 12:09:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 12:09:29,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:29,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:29,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:29,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:09:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 12:09:29,417 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2018-11-23 12:09:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:29,418 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 12:09:29,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:09:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 12:09:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:09:29,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:29,419 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:29,419 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:29,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:29,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1533202006, now seen corresponding path program 6 times [2018-11-23 12:09:29,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:29,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:29,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:29,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {1552#true} call ULTIMATE.init(); {1552#true} is VALID [2018-11-23 12:09:29,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {1552#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1552#true} is VALID [2018-11-23 12:09:29,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {1552#true} assume true; {1552#true} is VALID [2018-11-23 12:09:29,638 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1552#true} {1552#true} #60#return; {1552#true} is VALID [2018-11-23 12:09:29,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {1552#true} call #t~ret4 := main(); {1552#true} is VALID [2018-11-23 12:09:29,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {1552#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1554#(= main_~i~0 0)} is VALID [2018-11-23 12:09:29,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {1554#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1555#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:29,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {1555#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1556#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:29,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {1556#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1557#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:29,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {1557#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1558#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:29,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {1558#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1559#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:29,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {1559#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1560#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:29,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {1560#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1561#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:29,656 INFO L273 TraceCheckUtils]: 13: Hoare triple {1561#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1553#false} is VALID [2018-11-23 12:09:29,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {1553#false} ~i~0 := 1; {1553#false} is VALID [2018-11-23 12:09:29,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {1553#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1553#false} is VALID [2018-11-23 12:09:29,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {1553#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1553#false} is VALID [2018-11-23 12:09:29,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {1553#false} assume !(~i~0 < 100000); {1553#false} is VALID [2018-11-23 12:09:29,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {1553#false} ~i~0 := 1;~j~0 := 0; {1553#false} is VALID [2018-11-23 12:09:29,657 INFO L273 TraceCheckUtils]: 19: Hoare triple {1553#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {1553#false} is VALID [2018-11-23 12:09:29,657 INFO L256 TraceCheckUtils]: 20: Hoare triple {1553#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1553#false} is VALID [2018-11-23 12:09:29,657 INFO L273 TraceCheckUtils]: 21: Hoare triple {1553#false} ~cond := #in~cond; {1553#false} is VALID [2018-11-23 12:09:29,657 INFO L273 TraceCheckUtils]: 22: Hoare triple {1553#false} assume 0 == ~cond; {1553#false} is VALID [2018-11-23 12:09:29,658 INFO L273 TraceCheckUtils]: 23: Hoare triple {1553#false} assume !false; {1553#false} is VALID [2018-11-23 12:09:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:09:29,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:29,660 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:09:29,674 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:09:29,724 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-11-23 12:09:29,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:29,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:29,856 INFO L256 TraceCheckUtils]: 0: Hoare triple {1552#true} call ULTIMATE.init(); {1552#true} is VALID [2018-11-23 12:09:29,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {1552#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1552#true} is VALID [2018-11-23 12:09:29,857 INFO L273 TraceCheckUtils]: 2: Hoare triple {1552#true} assume true; {1552#true} is VALID [2018-11-23 12:09:29,857 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1552#true} {1552#true} #60#return; {1552#true} is VALID [2018-11-23 12:09:29,857 INFO L256 TraceCheckUtils]: 4: Hoare triple {1552#true} call #t~ret4 := main(); {1552#true} is VALID [2018-11-23 12:09:29,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {1552#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1552#true} is VALID [2018-11-23 12:09:29,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {1552#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1552#true} is VALID [2018-11-23 12:09:29,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {1552#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1552#true} is VALID [2018-11-23 12:09:29,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {1552#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1552#true} is VALID [2018-11-23 12:09:29,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {1552#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1552#true} is VALID [2018-11-23 12:09:29,858 INFO L273 TraceCheckUtils]: 10: Hoare triple {1552#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1552#true} is VALID [2018-11-23 12:09:29,859 INFO L273 TraceCheckUtils]: 11: Hoare triple {1552#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1552#true} is VALID [2018-11-23 12:09:29,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {1552#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1552#true} is VALID [2018-11-23 12:09:29,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {1552#true} assume !(~i~0 < 100000); {1552#true} is VALID [2018-11-23 12:09:29,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {1552#true} ~i~0 := 1; {1555#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:29,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {1555#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1610#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:29,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {1610#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1614#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:29,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {1614#(<= main_~i~0 17)} assume !(~i~0 < 100000); {1553#false} is VALID [2018-11-23 12:09:29,862 INFO L273 TraceCheckUtils]: 18: Hoare triple {1553#false} ~i~0 := 1;~j~0 := 0; {1553#false} is VALID [2018-11-23 12:09:29,862 INFO L273 TraceCheckUtils]: 19: Hoare triple {1553#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {1553#false} is VALID [2018-11-23 12:09:29,863 INFO L256 TraceCheckUtils]: 20: Hoare triple {1553#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1553#false} is VALID [2018-11-23 12:09:29,863 INFO L273 TraceCheckUtils]: 21: Hoare triple {1553#false} ~cond := #in~cond; {1553#false} is VALID [2018-11-23 12:09:29,863 INFO L273 TraceCheckUtils]: 22: Hoare triple {1553#false} assume 0 == ~cond; {1553#false} is VALID [2018-11-23 12:09:29,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {1553#false} assume !false; {1553#false} is VALID [2018-11-23 12:09:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:09:29,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:29,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 12 [2018-11-23 12:09:29,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-11-23 12:09:29,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:29,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:09:29,928 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:09:29,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:09:29,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:09:29,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:09:29,929 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-11-23 12:09:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:30,761 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-11-23 12:09:30,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:09:30,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-11-23 12:09:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:09:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2018-11-23 12:09:30,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:09:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2018-11-23 12:09:30,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 63 transitions. [2018-11-23 12:09:30,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:30,875 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:09:30,875 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:09:30,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:09:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:09:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-11-23 12:09:30,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:30,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 32 states. [2018-11-23 12:09:30,913 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 32 states. [2018-11-23 12:09:30,913 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 32 states. [2018-11-23 12:09:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:30,916 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 12:09:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:09:30,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:30,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:30,916 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 41 states. [2018-11-23 12:09:30,917 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 41 states. [2018-11-23 12:09:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:30,919 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 12:09:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:09:30,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:30,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:30,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:30,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:09:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 12:09:30,921 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2018-11-23 12:09:30,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:30,922 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 12:09:30,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:09:30,922 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 12:09:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:09:30,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:30,923 INFO L402 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:30,923 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:30,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:30,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2083735689, now seen corresponding path program 7 times [2018-11-23 12:09:30,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:30,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:30,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:30,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:30,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:31,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {1860#true} call ULTIMATE.init(); {1860#true} is VALID [2018-11-23 12:09:31,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {1860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1860#true} is VALID [2018-11-23 12:09:31,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {1860#true} assume true; {1860#true} is VALID [2018-11-23 12:09:31,172 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1860#true} {1860#true} #60#return; {1860#true} is VALID [2018-11-23 12:09:31,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {1860#true} call #t~ret4 := main(); {1860#true} is VALID [2018-11-23 12:09:31,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {1860#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1862#(= main_~i~0 0)} is VALID [2018-11-23 12:09:31,175 INFO L273 TraceCheckUtils]: 6: Hoare triple {1862#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1863#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:31,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {1863#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1864#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:31,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {1864#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1865#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:31,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {1865#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1866#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:31,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {1866#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1867#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:31,180 INFO L273 TraceCheckUtils]: 11: Hoare triple {1867#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1868#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:31,181 INFO L273 TraceCheckUtils]: 12: Hoare triple {1868#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1869#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:31,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {1869#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1870#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:31,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {1870#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1871#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:31,187 INFO L273 TraceCheckUtils]: 15: Hoare triple {1871#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1872#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:31,188 INFO L273 TraceCheckUtils]: 16: Hoare triple {1872#(<= main_~i~0 10)} assume !(~i~0 < 100000); {1861#false} is VALID [2018-11-23 12:09:31,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {1861#false} ~i~0 := 1; {1861#false} is VALID [2018-11-23 12:09:31,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {1861#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1861#false} is VALID [2018-11-23 12:09:31,188 INFO L273 TraceCheckUtils]: 19: Hoare triple {1861#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1861#false} is VALID [2018-11-23 12:09:31,189 INFO L273 TraceCheckUtils]: 20: Hoare triple {1861#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1861#false} is VALID [2018-11-23 12:09:31,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {1861#false} assume !(~i~0 < 100000); {1861#false} is VALID [2018-11-23 12:09:31,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {1861#false} ~i~0 := 1;~j~0 := 0; {1861#false} is VALID [2018-11-23 12:09:31,189 INFO L273 TraceCheckUtils]: 23: Hoare triple {1861#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {1861#false} is VALID [2018-11-23 12:09:31,189 INFO L256 TraceCheckUtils]: 24: Hoare triple {1861#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1861#false} is VALID [2018-11-23 12:09:31,189 INFO L273 TraceCheckUtils]: 25: Hoare triple {1861#false} ~cond := #in~cond; {1861#false} is VALID [2018-11-23 12:09:31,189 INFO L273 TraceCheckUtils]: 26: Hoare triple {1861#false} assume 0 == ~cond; {1861#false} is VALID [2018-11-23 12:09:31,190 INFO L273 TraceCheckUtils]: 27: Hoare triple {1861#false} assume !false; {1861#false} is VALID [2018-11-23 12:09:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:09:31,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:31,191 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:09:31,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:31,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:32,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {1860#true} call ULTIMATE.init(); {1860#true} is VALID [2018-11-23 12:09:32,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {1860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1860#true} is VALID [2018-11-23 12:09:32,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {1860#true} assume true; {1860#true} is VALID [2018-11-23 12:09:32,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1860#true} {1860#true} #60#return; {1860#true} is VALID [2018-11-23 12:09:32,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {1860#true} call #t~ret4 := main(); {1860#true} is VALID [2018-11-23 12:09:32,200 INFO L273 TraceCheckUtils]: 5: Hoare triple {1860#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1891#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:32,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {1891#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1863#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:32,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {1863#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1864#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:32,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {1864#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1865#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:32,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {1865#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1866#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:32,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {1866#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1867#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:32,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {1867#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1868#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:32,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {1868#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1869#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:32,216 INFO L273 TraceCheckUtils]: 13: Hoare triple {1869#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1870#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:32,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {1870#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1871#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:32,217 INFO L273 TraceCheckUtils]: 15: Hoare triple {1871#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1872#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:32,218 INFO L273 TraceCheckUtils]: 16: Hoare triple {1872#(<= main_~i~0 10)} assume !(~i~0 < 100000); {1861#false} is VALID [2018-11-23 12:09:32,218 INFO L273 TraceCheckUtils]: 17: Hoare triple {1861#false} ~i~0 := 1; {1861#false} is VALID [2018-11-23 12:09:32,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {1861#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1861#false} is VALID [2018-11-23 12:09:32,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {1861#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1861#false} is VALID [2018-11-23 12:09:32,219 INFO L273 TraceCheckUtils]: 20: Hoare triple {1861#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {1861#false} is VALID [2018-11-23 12:09:32,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {1861#false} assume !(~i~0 < 100000); {1861#false} is VALID [2018-11-23 12:09:32,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {1861#false} ~i~0 := 1;~j~0 := 0; {1861#false} is VALID [2018-11-23 12:09:32,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {1861#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {1861#false} is VALID [2018-11-23 12:09:32,220 INFO L256 TraceCheckUtils]: 24: Hoare triple {1861#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1861#false} is VALID [2018-11-23 12:09:32,221 INFO L273 TraceCheckUtils]: 25: Hoare triple {1861#false} ~cond := #in~cond; {1861#false} is VALID [2018-11-23 12:09:32,221 INFO L273 TraceCheckUtils]: 26: Hoare triple {1861#false} assume 0 == ~cond; {1861#false} is VALID [2018-11-23 12:09:32,221 INFO L273 TraceCheckUtils]: 27: Hoare triple {1861#false} assume !false; {1861#false} is VALID [2018-11-23 12:09:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:09:32,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:32,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:09:32,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 12:09:32,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:32,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:09:32,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:32,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:09:32,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:09:32,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:09:32,288 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 14 states. [2018-11-23 12:09:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:32,529 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-23 12:09:32,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:09:32,530 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 12:09:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:09:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-23 12:09:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:09:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-23 12:09:32,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2018-11-23 12:09:32,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:32,638 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:09:32,639 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:09:32,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:09:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:09:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-23 12:09:32,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:32,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 33 states. [2018-11-23 12:09:32,722 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 33 states. [2018-11-23 12:09:32,722 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 33 states. [2018-11-23 12:09:32,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:32,724 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:09:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:09:32,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:32,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:32,725 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 39 states. [2018-11-23 12:09:32,725 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 39 states. [2018-11-23 12:09:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:32,727 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:09:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:09:32,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:32,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:32,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:32,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:09:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 12:09:32,729 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2018-11-23 12:09:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:32,730 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 12:09:32,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:09:32,730 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 12:09:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:09:32,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:32,731 INFO L402 BasicCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:32,731 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:32,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:32,731 INFO L82 PathProgramCache]: Analyzing trace with hash -20205851, now seen corresponding path program 8 times [2018-11-23 12:09:32,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:32,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:32,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:32,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:32,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:33,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {2179#true} call ULTIMATE.init(); {2179#true} is VALID [2018-11-23 12:09:33,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {2179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2179#true} is VALID [2018-11-23 12:09:33,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {2179#true} assume true; {2179#true} is VALID [2018-11-23 12:09:33,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2179#true} {2179#true} #60#return; {2179#true} is VALID [2018-11-23 12:09:33,043 INFO L256 TraceCheckUtils]: 4: Hoare triple {2179#true} call #t~ret4 := main(); {2179#true} is VALID [2018-11-23 12:09:33,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {2179#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2181#(= main_~i~0 0)} is VALID [2018-11-23 12:09:33,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {2181#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2182#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:33,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {2182#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2183#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:33,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {2183#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2184#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:33,052 INFO L273 TraceCheckUtils]: 9: Hoare triple {2184#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2185#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:33,053 INFO L273 TraceCheckUtils]: 10: Hoare triple {2185#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2186#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:33,053 INFO L273 TraceCheckUtils]: 11: Hoare triple {2186#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2187#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:33,054 INFO L273 TraceCheckUtils]: 12: Hoare triple {2187#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2188#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:33,060 INFO L273 TraceCheckUtils]: 13: Hoare triple {2188#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2189#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:33,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {2189#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2190#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:33,061 INFO L273 TraceCheckUtils]: 15: Hoare triple {2190#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2191#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:33,062 INFO L273 TraceCheckUtils]: 16: Hoare triple {2191#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2192#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:33,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {2192#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2180#false} is VALID [2018-11-23 12:09:33,063 INFO L273 TraceCheckUtils]: 18: Hoare triple {2180#false} ~i~0 := 1; {2180#false} is VALID [2018-11-23 12:09:33,063 INFO L273 TraceCheckUtils]: 19: Hoare triple {2180#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2180#false} is VALID [2018-11-23 12:09:33,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {2180#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2180#false} is VALID [2018-11-23 12:09:33,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {2180#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2180#false} is VALID [2018-11-23 12:09:33,064 INFO L273 TraceCheckUtils]: 22: Hoare triple {2180#false} assume !(~i~0 < 100000); {2180#false} is VALID [2018-11-23 12:09:33,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {2180#false} ~i~0 := 1;~j~0 := 0; {2180#false} is VALID [2018-11-23 12:09:33,064 INFO L273 TraceCheckUtils]: 24: Hoare triple {2180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {2180#false} is VALID [2018-11-23 12:09:33,064 INFO L256 TraceCheckUtils]: 25: Hoare triple {2180#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2180#false} is VALID [2018-11-23 12:09:33,065 INFO L273 TraceCheckUtils]: 26: Hoare triple {2180#false} ~cond := #in~cond; {2180#false} is VALID [2018-11-23 12:09:33,065 INFO L273 TraceCheckUtils]: 27: Hoare triple {2180#false} assume 0 == ~cond; {2180#false} is VALID [2018-11-23 12:09:33,065 INFO L273 TraceCheckUtils]: 28: Hoare triple {2180#false} assume !false; {2180#false} is VALID [2018-11-23 12:09:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:09:33,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:33,067 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:09:33,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:09:33,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:09:33,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:33,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:33,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {2179#true} call ULTIMATE.init(); {2179#true} is VALID [2018-11-23 12:09:33,238 INFO L273 TraceCheckUtils]: 1: Hoare triple {2179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2179#true} is VALID [2018-11-23 12:09:33,238 INFO L273 TraceCheckUtils]: 2: Hoare triple {2179#true} assume true; {2179#true} is VALID [2018-11-23 12:09:33,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2179#true} {2179#true} #60#return; {2179#true} is VALID [2018-11-23 12:09:33,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {2179#true} call #t~ret4 := main(); {2179#true} is VALID [2018-11-23 12:09:33,240 INFO L273 TraceCheckUtils]: 5: Hoare triple {2179#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2211#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:33,241 INFO L273 TraceCheckUtils]: 6: Hoare triple {2211#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2182#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:33,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {2182#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2183#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:33,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {2183#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2184#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:33,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {2184#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2185#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:33,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {2185#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2186#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:33,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {2186#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2187#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:33,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {2187#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2188#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:33,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {2188#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2189#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:33,251 INFO L273 TraceCheckUtils]: 14: Hoare triple {2189#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2190#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:33,252 INFO L273 TraceCheckUtils]: 15: Hoare triple {2190#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2191#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:33,253 INFO L273 TraceCheckUtils]: 16: Hoare triple {2191#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2192#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:33,254 INFO L273 TraceCheckUtils]: 17: Hoare triple {2192#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2180#false} is VALID [2018-11-23 12:09:33,254 INFO L273 TraceCheckUtils]: 18: Hoare triple {2180#false} ~i~0 := 1; {2180#false} is VALID [2018-11-23 12:09:33,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {2180#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2180#false} is VALID [2018-11-23 12:09:33,255 INFO L273 TraceCheckUtils]: 20: Hoare triple {2180#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2180#false} is VALID [2018-11-23 12:09:33,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {2180#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2180#false} is VALID [2018-11-23 12:09:33,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {2180#false} assume !(~i~0 < 100000); {2180#false} is VALID [2018-11-23 12:09:33,255 INFO L273 TraceCheckUtils]: 23: Hoare triple {2180#false} ~i~0 := 1;~j~0 := 0; {2180#false} is VALID [2018-11-23 12:09:33,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {2180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {2180#false} is VALID [2018-11-23 12:09:33,256 INFO L256 TraceCheckUtils]: 25: Hoare triple {2180#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2180#false} is VALID [2018-11-23 12:09:33,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {2180#false} ~cond := #in~cond; {2180#false} is VALID [2018-11-23 12:09:33,256 INFO L273 TraceCheckUtils]: 27: Hoare triple {2180#false} assume 0 == ~cond; {2180#false} is VALID [2018-11-23 12:09:33,257 INFO L273 TraceCheckUtils]: 28: Hoare triple {2180#false} assume !false; {2180#false} is VALID [2018-11-23 12:09:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:09:33,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:33,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:09:33,279 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-23 12:09:33,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:33,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:09:33,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:33,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:09:33,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:09:33,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:09:33,305 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 15 states. [2018-11-23 12:09:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:33,865 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-23 12:09:33,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:09:33,866 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-23 12:09:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:09:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2018-11-23 12:09:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:09:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2018-11-23 12:09:33,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 57 transitions. [2018-11-23 12:09:33,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:33,935 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:09:33,935 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:09:33,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:09:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:09:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-11-23 12:09:33,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:33,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 34 states. [2018-11-23 12:09:33,957 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 34 states. [2018-11-23 12:09:33,957 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 34 states. [2018-11-23 12:09:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:33,959 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:09:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:09:33,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:33,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:33,959 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 40 states. [2018-11-23 12:09:33,959 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 40 states. [2018-11-23 12:09:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:33,961 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:09:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:09:33,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:33,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:33,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:33,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:09:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 12:09:33,963 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 29 [2018-11-23 12:09:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:33,963 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 12:09:33,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:09:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 12:09:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:09:33,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:33,964 INFO L402 BasicCegarLoop]: trace histogram [12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:33,964 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:33,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:33,965 INFO L82 PathProgramCache]: Analyzing trace with hash -817884151, now seen corresponding path program 9 times [2018-11-23 12:09:33,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:33,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:33,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:33,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:33,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:34,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {2508#true} call ULTIMATE.init(); {2508#true} is VALID [2018-11-23 12:09:34,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {2508#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2508#true} is VALID [2018-11-23 12:09:34,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {2508#true} assume true; {2508#true} is VALID [2018-11-23 12:09:34,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2508#true} {2508#true} #60#return; {2508#true} is VALID [2018-11-23 12:09:34,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {2508#true} call #t~ret4 := main(); {2508#true} is VALID [2018-11-23 12:09:34,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {2508#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2510#(= main_~i~0 0)} is VALID [2018-11-23 12:09:34,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {2510#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2511#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:34,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {2511#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2512#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:34,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {2512#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2513#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:34,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {2513#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2514#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:34,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {2514#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2515#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:34,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {2515#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2516#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:34,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {2516#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2517#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:34,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {2517#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2518#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:34,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {2518#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2519#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:34,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {2519#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2520#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:34,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {2520#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2521#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:34,278 INFO L273 TraceCheckUtils]: 17: Hoare triple {2521#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2522#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:34,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {2522#(<= main_~i~0 12)} assume !(~i~0 < 100000); {2509#false} is VALID [2018-11-23 12:09:34,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {2509#false} ~i~0 := 1; {2509#false} is VALID [2018-11-23 12:09:34,280 INFO L273 TraceCheckUtils]: 20: Hoare triple {2509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2509#false} is VALID [2018-11-23 12:09:34,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {2509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2509#false} is VALID [2018-11-23 12:09:34,280 INFO L273 TraceCheckUtils]: 22: Hoare triple {2509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2509#false} is VALID [2018-11-23 12:09:34,281 INFO L273 TraceCheckUtils]: 23: Hoare triple {2509#false} assume !(~i~0 < 100000); {2509#false} is VALID [2018-11-23 12:09:34,281 INFO L273 TraceCheckUtils]: 24: Hoare triple {2509#false} ~i~0 := 1;~j~0 := 0; {2509#false} is VALID [2018-11-23 12:09:34,281 INFO L273 TraceCheckUtils]: 25: Hoare triple {2509#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {2509#false} is VALID [2018-11-23 12:09:34,282 INFO L256 TraceCheckUtils]: 26: Hoare triple {2509#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2509#false} is VALID [2018-11-23 12:09:34,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {2509#false} ~cond := #in~cond; {2509#false} is VALID [2018-11-23 12:09:34,282 INFO L273 TraceCheckUtils]: 28: Hoare triple {2509#false} assume 0 == ~cond; {2509#false} is VALID [2018-11-23 12:09:34,282 INFO L273 TraceCheckUtils]: 29: Hoare triple {2509#false} assume !false; {2509#false} is VALID [2018-11-23 12:09:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:09:34,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:34,284 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:09:34,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:09:34,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:09:34,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:34,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:34,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {2508#true} call ULTIMATE.init(); {2508#true} is VALID [2018-11-23 12:09:34,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {2508#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2508#true} is VALID [2018-11-23 12:09:34,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {2508#true} assume true; {2508#true} is VALID [2018-11-23 12:09:34,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2508#true} {2508#true} #60#return; {2508#true} is VALID [2018-11-23 12:09:34,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {2508#true} call #t~ret4 := main(); {2508#true} is VALID [2018-11-23 12:09:34,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {2508#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2508#true} is VALID [2018-11-23 12:09:34,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {2508#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2508#true} is VALID [2018-11-23 12:09:34,661 INFO L273 TraceCheckUtils]: 7: Hoare triple {2508#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2508#true} is VALID [2018-11-23 12:09:34,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {2508#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2508#true} is VALID [2018-11-23 12:09:34,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {2508#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2508#true} is VALID [2018-11-23 12:09:34,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {2508#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2508#true} is VALID [2018-11-23 12:09:34,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {2508#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2508#true} is VALID [2018-11-23 12:09:34,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {2508#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2508#true} is VALID [2018-11-23 12:09:34,662 INFO L273 TraceCheckUtils]: 13: Hoare triple {2508#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2508#true} is VALID [2018-11-23 12:09:34,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {2508#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2508#true} is VALID [2018-11-23 12:09:34,662 INFO L273 TraceCheckUtils]: 15: Hoare triple {2508#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2508#true} is VALID [2018-11-23 12:09:34,662 INFO L273 TraceCheckUtils]: 16: Hoare triple {2508#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2508#true} is VALID [2018-11-23 12:09:34,663 INFO L273 TraceCheckUtils]: 17: Hoare triple {2508#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2508#true} is VALID [2018-11-23 12:09:34,663 INFO L273 TraceCheckUtils]: 18: Hoare triple {2508#true} assume !(~i~0 < 100000); {2508#true} is VALID [2018-11-23 12:09:34,663 INFO L273 TraceCheckUtils]: 19: Hoare triple {2508#true} ~i~0 := 1; {2511#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:34,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {2511#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2519#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:34,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {2519#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2589#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:34,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {2589#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2593#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:34,666 INFO L273 TraceCheckUtils]: 23: Hoare triple {2593#(<= main_~i~0 25)} assume !(~i~0 < 100000); {2509#false} is VALID [2018-11-23 12:09:34,666 INFO L273 TraceCheckUtils]: 24: Hoare triple {2509#false} ~i~0 := 1;~j~0 := 0; {2509#false} is VALID [2018-11-23 12:09:34,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {2509#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {2509#false} is VALID [2018-11-23 12:09:34,666 INFO L256 TraceCheckUtils]: 26: Hoare triple {2509#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2509#false} is VALID [2018-11-23 12:09:34,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {2509#false} ~cond := #in~cond; {2509#false} is VALID [2018-11-23 12:09:34,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {2509#false} assume 0 == ~cond; {2509#false} is VALID [2018-11-23 12:09:34,667 INFO L273 TraceCheckUtils]: 29: Hoare triple {2509#false} assume !false; {2509#false} is VALID [2018-11-23 12:09:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:09:34,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:34,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 17 [2018-11-23 12:09:34,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-11-23 12:09:34,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:34,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:09:34,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:34,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:09:34,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:09:34,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:09:34,748 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 17 states. [2018-11-23 12:09:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:35,233 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-23 12:09:35,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:09:35,233 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-11-23 12:09:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:09:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 73 transitions. [2018-11-23 12:09:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:09:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 73 transitions. [2018-11-23 12:09:35,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 73 transitions. [2018-11-23 12:09:35,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:35,332 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:09:35,332 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:09:35,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:09:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:09:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2018-11-23 12:09:35,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:35,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 38 states. [2018-11-23 12:09:35,392 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 38 states. [2018-11-23 12:09:35,393 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 38 states. [2018-11-23 12:09:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:35,394 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 12:09:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-23 12:09:35,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:35,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:35,395 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 50 states. [2018-11-23 12:09:35,395 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 50 states. [2018-11-23 12:09:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:35,396 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 12:09:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-23 12:09:35,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:35,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:35,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:35,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:09:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 12:09:35,399 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 30 [2018-11-23 12:09:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:35,399 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 12:09:35,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:09:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 12:09:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:09:35,400 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:35,400 INFO L402 BasicCegarLoop]: trace histogram [15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:35,401 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:35,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:35,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1076963082, now seen corresponding path program 10 times [2018-11-23 12:09:35,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:35,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:35,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:35,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:35,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:35,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {2888#true} call ULTIMATE.init(); {2888#true} is VALID [2018-11-23 12:09:35,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {2888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2888#true} is VALID [2018-11-23 12:09:35,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {2888#true} assume true; {2888#true} is VALID [2018-11-23 12:09:35,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2888#true} {2888#true} #60#return; {2888#true} is VALID [2018-11-23 12:09:35,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {2888#true} call #t~ret4 := main(); {2888#true} is VALID [2018-11-23 12:09:35,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {2888#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2890#(= main_~i~0 0)} is VALID [2018-11-23 12:09:35,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {2890#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2891#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:35,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {2891#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2892#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:35,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {2892#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2893#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:35,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {2893#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2894#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:35,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {2894#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2895#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:35,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {2895#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2896#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:35,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {2896#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2897#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:35,794 INFO L273 TraceCheckUtils]: 13: Hoare triple {2897#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2898#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:35,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {2898#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2899#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:35,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {2899#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2900#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:35,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {2900#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2901#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:35,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {2901#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2902#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:35,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {2902#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2903#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:35,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {2903#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2904#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:35,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {2904#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2905#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:35,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {2905#(<= main_~i~0 15)} assume !(~i~0 < 100000); {2889#false} is VALID [2018-11-23 12:09:35,803 INFO L273 TraceCheckUtils]: 22: Hoare triple {2889#false} ~i~0 := 1; {2889#false} is VALID [2018-11-23 12:09:35,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:09:35,803 INFO L273 TraceCheckUtils]: 24: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:09:35,803 INFO L273 TraceCheckUtils]: 25: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:09:35,803 INFO L273 TraceCheckUtils]: 26: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:09:35,804 INFO L273 TraceCheckUtils]: 27: Hoare triple {2889#false} assume !(~i~0 < 100000); {2889#false} is VALID [2018-11-23 12:09:35,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {2889#false} ~i~0 := 1;~j~0 := 0; {2889#false} is VALID [2018-11-23 12:09:35,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {2889#false} is VALID [2018-11-23 12:09:35,804 INFO L256 TraceCheckUtils]: 30: Hoare triple {2889#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2889#false} is VALID [2018-11-23 12:09:35,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {2889#false} ~cond := #in~cond; {2889#false} is VALID [2018-11-23 12:09:35,805 INFO L273 TraceCheckUtils]: 32: Hoare triple {2889#false} assume 0 == ~cond; {2889#false} is VALID [2018-11-23 12:09:35,805 INFO L273 TraceCheckUtils]: 33: Hoare triple {2889#false} assume !false; {2889#false} is VALID [2018-11-23 12:09:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:09:35,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:35,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:35,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:09:35,859 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:09:35,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:35,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:36,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {2888#true} call ULTIMATE.init(); {2888#true} is VALID [2018-11-23 12:09:36,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {2888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2888#true} is VALID [2018-11-23 12:09:36,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {2888#true} assume true; {2888#true} is VALID [2018-11-23 12:09:36,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2888#true} {2888#true} #60#return; {2888#true} is VALID [2018-11-23 12:09:36,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {2888#true} call #t~ret4 := main(); {2888#true} is VALID [2018-11-23 12:09:36,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {2888#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2924#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:36,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {2924#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2891#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:36,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {2891#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2892#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:36,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {2892#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2893#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:36,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {2893#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2894#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:36,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {2894#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2895#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:36,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {2895#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2896#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:36,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {2896#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2897#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:36,109 INFO L273 TraceCheckUtils]: 13: Hoare triple {2897#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2898#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:36,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {2898#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2899#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:36,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {2899#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2900#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:36,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {2900#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2901#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:36,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {2901#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2902#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:36,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {2902#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2903#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:36,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {2903#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2904#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:36,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {2904#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2905#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:36,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {2905#(<= main_~i~0 15)} assume !(~i~0 < 100000); {2889#false} is VALID [2018-11-23 12:09:36,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {2889#false} ~i~0 := 1; {2889#false} is VALID [2018-11-23 12:09:36,116 INFO L273 TraceCheckUtils]: 23: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:09:36,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:09:36,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:09:36,117 INFO L273 TraceCheckUtils]: 26: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:09:36,117 INFO L273 TraceCheckUtils]: 27: Hoare triple {2889#false} assume !(~i~0 < 100000); {2889#false} is VALID [2018-11-23 12:09:36,117 INFO L273 TraceCheckUtils]: 28: Hoare triple {2889#false} ~i~0 := 1;~j~0 := 0; {2889#false} is VALID [2018-11-23 12:09:36,118 INFO L273 TraceCheckUtils]: 29: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {2889#false} is VALID [2018-11-23 12:09:36,118 INFO L256 TraceCheckUtils]: 30: Hoare triple {2889#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2889#false} is VALID [2018-11-23 12:09:36,118 INFO L273 TraceCheckUtils]: 31: Hoare triple {2889#false} ~cond := #in~cond; {2889#false} is VALID [2018-11-23 12:09:36,118 INFO L273 TraceCheckUtils]: 32: Hoare triple {2889#false} assume 0 == ~cond; {2889#false} is VALID [2018-11-23 12:09:36,119 INFO L273 TraceCheckUtils]: 33: Hoare triple {2889#false} assume !false; {2889#false} is VALID [2018-11-23 12:09:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:09:36,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:36,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:09:36,141 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-11-23 12:09:36,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:36,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:09:36,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:36,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:09:36,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:09:36,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:09:36,169 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 19 states. [2018-11-23 12:09:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:36,713 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-11-23 12:09:36,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:09:36,714 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-11-23 12:09:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:09:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 61 transitions. [2018-11-23 12:09:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:09:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 61 transitions. [2018-11-23 12:09:36,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 61 transitions. [2018-11-23 12:09:36,785 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:09:36,786 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:09:36,787 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:09:36,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:09:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:09:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-11-23 12:09:36,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:36,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 39 states. [2018-11-23 12:09:36,821 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 39 states. [2018-11-23 12:09:36,821 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 39 states. [2018-11-23 12:09:36,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:36,822 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:09:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:09:36,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:36,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:36,823 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 45 states. [2018-11-23 12:09:36,823 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 45 states. [2018-11-23 12:09:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:36,824 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:09:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:09:36,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:36,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:36,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:36,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:09:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 12:09:36,826 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2018-11-23 12:09:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:36,826 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 12:09:36,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:09:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 12:09:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:09:36,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:36,827 INFO L402 BasicCegarLoop]: trace histogram [16, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:36,827 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:36,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash 790780006, now seen corresponding path program 11 times [2018-11-23 12:09:36,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:36,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:36,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:36,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:36,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:37,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {3268#true} call ULTIMATE.init(); {3268#true} is VALID [2018-11-23 12:09:37,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {3268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3268#true} is VALID [2018-11-23 12:09:37,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {3268#true} assume true; {3268#true} is VALID [2018-11-23 12:09:37,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3268#true} {3268#true} #60#return; {3268#true} is VALID [2018-11-23 12:09:37,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {3268#true} call #t~ret4 := main(); {3268#true} is VALID [2018-11-23 12:09:37,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {3268#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3270#(= main_~i~0 0)} is VALID [2018-11-23 12:09:37,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {3270#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3271#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:37,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {3271#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3272#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:37,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {3272#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3273#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:37,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {3273#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3274#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:37,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {3274#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3275#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:37,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {3275#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3276#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:37,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {3276#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3277#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:37,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {3277#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3278#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:37,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {3278#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3279#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:37,283 INFO L273 TraceCheckUtils]: 15: Hoare triple {3279#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3280#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:37,284 INFO L273 TraceCheckUtils]: 16: Hoare triple {3280#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3281#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:37,285 INFO L273 TraceCheckUtils]: 17: Hoare triple {3281#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3282#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:37,286 INFO L273 TraceCheckUtils]: 18: Hoare triple {3282#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3283#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:37,287 INFO L273 TraceCheckUtils]: 19: Hoare triple {3283#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3284#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:37,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {3284#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3285#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:37,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {3285#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3286#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:37,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {3286#(<= main_~i~0 16)} assume !(~i~0 < 100000); {3269#false} is VALID [2018-11-23 12:09:37,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {3269#false} ~i~0 := 1; {3269#false} is VALID [2018-11-23 12:09:37,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {3269#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3269#false} is VALID [2018-11-23 12:09:37,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {3269#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3269#false} is VALID [2018-11-23 12:09:37,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {3269#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3269#false} is VALID [2018-11-23 12:09:37,292 INFO L273 TraceCheckUtils]: 27: Hoare triple {3269#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3269#false} is VALID [2018-11-23 12:09:37,292 INFO L273 TraceCheckUtils]: 28: Hoare triple {3269#false} assume !(~i~0 < 100000); {3269#false} is VALID [2018-11-23 12:09:37,292 INFO L273 TraceCheckUtils]: 29: Hoare triple {3269#false} ~i~0 := 1;~j~0 := 0; {3269#false} is VALID [2018-11-23 12:09:37,293 INFO L273 TraceCheckUtils]: 30: Hoare triple {3269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {3269#false} is VALID [2018-11-23 12:09:37,293 INFO L256 TraceCheckUtils]: 31: Hoare triple {3269#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3269#false} is VALID [2018-11-23 12:09:37,293 INFO L273 TraceCheckUtils]: 32: Hoare triple {3269#false} ~cond := #in~cond; {3269#false} is VALID [2018-11-23 12:09:37,294 INFO L273 TraceCheckUtils]: 33: Hoare triple {3269#false} assume 0 == ~cond; {3269#false} is VALID [2018-11-23 12:09:37,294 INFO L273 TraceCheckUtils]: 34: Hoare triple {3269#false} assume !false; {3269#false} is VALID [2018-11-23 12:09:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:09:37,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:37,296 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:37,304 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:09:37,651 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 12:09:37,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:37,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:37,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {3268#true} call ULTIMATE.init(); {3268#true} is VALID [2018-11-23 12:09:37,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {3268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3268#true} is VALID [2018-11-23 12:09:37,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {3268#true} assume true; {3268#true} is VALID [2018-11-23 12:09:37,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3268#true} {3268#true} #60#return; {3268#true} is VALID [2018-11-23 12:09:37,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {3268#true} call #t~ret4 := main(); {3268#true} is VALID [2018-11-23 12:09:37,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {3268#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3305#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:37,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {3305#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3271#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:37,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {3271#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3272#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:37,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {3272#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3273#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:37,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {3273#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3274#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:37,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {3274#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3275#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:37,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {3275#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3276#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:37,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {3276#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3277#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:38,000 INFO L273 TraceCheckUtils]: 13: Hoare triple {3277#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3278#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:38,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {3278#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3279#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:38,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {3279#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3280#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:38,005 INFO L273 TraceCheckUtils]: 16: Hoare triple {3280#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3281#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:38,007 INFO L273 TraceCheckUtils]: 17: Hoare triple {3281#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3282#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:38,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {3282#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3283#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:38,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {3283#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3284#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:38,021 INFO L273 TraceCheckUtils]: 20: Hoare triple {3284#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3285#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:38,023 INFO L273 TraceCheckUtils]: 21: Hoare triple {3285#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3286#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:38,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {3286#(<= main_~i~0 16)} assume !(~i~0 < 100000); {3269#false} is VALID [2018-11-23 12:09:38,023 INFO L273 TraceCheckUtils]: 23: Hoare triple {3269#false} ~i~0 := 1; {3269#false} is VALID [2018-11-23 12:09:38,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {3269#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3269#false} is VALID [2018-11-23 12:09:38,024 INFO L273 TraceCheckUtils]: 25: Hoare triple {3269#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3269#false} is VALID [2018-11-23 12:09:38,024 INFO L273 TraceCheckUtils]: 26: Hoare triple {3269#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3269#false} is VALID [2018-11-23 12:09:38,024 INFO L273 TraceCheckUtils]: 27: Hoare triple {3269#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3269#false} is VALID [2018-11-23 12:09:38,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {3269#false} assume !(~i~0 < 100000); {3269#false} is VALID [2018-11-23 12:09:38,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {3269#false} ~i~0 := 1;~j~0 := 0; {3269#false} is VALID [2018-11-23 12:09:38,024 INFO L273 TraceCheckUtils]: 30: Hoare triple {3269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {3269#false} is VALID [2018-11-23 12:09:38,025 INFO L256 TraceCheckUtils]: 31: Hoare triple {3269#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3269#false} is VALID [2018-11-23 12:09:38,025 INFO L273 TraceCheckUtils]: 32: Hoare triple {3269#false} ~cond := #in~cond; {3269#false} is VALID [2018-11-23 12:09:38,025 INFO L273 TraceCheckUtils]: 33: Hoare triple {3269#false} assume 0 == ~cond; {3269#false} is VALID [2018-11-23 12:09:38,025 INFO L273 TraceCheckUtils]: 34: Hoare triple {3269#false} assume !false; {3269#false} is VALID [2018-11-23 12:09:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:09:38,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:38,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:09:38,048 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-11-23 12:09:38,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:38,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:09:38,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:38,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:09:38,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:09:38,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:09:38,079 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 20 states. [2018-11-23 12:09:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:38,572 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-23 12:09:38,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:09:38,573 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-11-23 12:09:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:09:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 62 transitions. [2018-11-23 12:09:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:09:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 62 transitions. [2018-11-23 12:09:38,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 62 transitions. [2018-11-23 12:09:38,685 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:09:38,686 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:09:38,686 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:09:38,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:09:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:09:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-11-23 12:09:38,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:38,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 40 states. [2018-11-23 12:09:38,714 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 40 states. [2018-11-23 12:09:38,714 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 40 states. [2018-11-23 12:09:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:38,716 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 12:09:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 12:09:38,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:38,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:38,717 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 46 states. [2018-11-23 12:09:38,717 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 46 states. [2018-11-23 12:09:38,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:38,718 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 12:09:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 12:09:38,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:38,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:38,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:38,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:09:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-23 12:09:38,720 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 35 [2018-11-23 12:09:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:38,720 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-23 12:09:38,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:09:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 12:09:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:09:38,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:38,721 INFO L402 BasicCegarLoop]: trace histogram [17, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:38,721 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:38,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:38,721 INFO L82 PathProgramCache]: Analyzing trace with hash 509039242, now seen corresponding path program 12 times [2018-11-23 12:09:38,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:38,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:38,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:38,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:39,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {3658#true} call ULTIMATE.init(); {3658#true} is VALID [2018-11-23 12:09:39,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {3658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3658#true} is VALID [2018-11-23 12:09:39,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {3658#true} assume true; {3658#true} is VALID [2018-11-23 12:09:39,596 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3658#true} {3658#true} #60#return; {3658#true} is VALID [2018-11-23 12:09:39,596 INFO L256 TraceCheckUtils]: 4: Hoare triple {3658#true} call #t~ret4 := main(); {3658#true} is VALID [2018-11-23 12:09:39,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {3658#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3660#(= main_~i~0 0)} is VALID [2018-11-23 12:09:39,598 INFO L273 TraceCheckUtils]: 6: Hoare triple {3660#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3661#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:39,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {3661#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:39,599 INFO L273 TraceCheckUtils]: 8: Hoare triple {3662#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3663#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:39,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {3663#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3664#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:39,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {3664#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3665#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:39,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {3665#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3666#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:39,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {3666#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3667#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:39,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {3667#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3668#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:39,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {3668#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3669#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:39,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {3669#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3670#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:39,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {3670#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3671#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:39,607 INFO L273 TraceCheckUtils]: 17: Hoare triple {3671#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3672#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:39,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {3672#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3673#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:39,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {3673#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3674#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:39,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {3674#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3675#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:39,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {3675#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3676#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:39,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {3676#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3677#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:39,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {3677#(<= main_~i~0 17)} assume !(~i~0 < 100000); {3659#false} is VALID [2018-11-23 12:09:39,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {3659#false} ~i~0 := 1; {3659#false} is VALID [2018-11-23 12:09:39,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {3659#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3659#false} is VALID [2018-11-23 12:09:39,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {3659#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3659#false} is VALID [2018-11-23 12:09:39,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {3659#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3659#false} is VALID [2018-11-23 12:09:39,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {3659#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3659#false} is VALID [2018-11-23 12:09:39,614 INFO L273 TraceCheckUtils]: 29: Hoare triple {3659#false} assume !(~i~0 < 100000); {3659#false} is VALID [2018-11-23 12:09:39,614 INFO L273 TraceCheckUtils]: 30: Hoare triple {3659#false} ~i~0 := 1;~j~0 := 0; {3659#false} is VALID [2018-11-23 12:09:39,614 INFO L273 TraceCheckUtils]: 31: Hoare triple {3659#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {3659#false} is VALID [2018-11-23 12:09:39,615 INFO L256 TraceCheckUtils]: 32: Hoare triple {3659#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3659#false} is VALID [2018-11-23 12:09:39,615 INFO L273 TraceCheckUtils]: 33: Hoare triple {3659#false} ~cond := #in~cond; {3659#false} is VALID [2018-11-23 12:09:39,615 INFO L273 TraceCheckUtils]: 34: Hoare triple {3659#false} assume 0 == ~cond; {3659#false} is VALID [2018-11-23 12:09:39,615 INFO L273 TraceCheckUtils]: 35: Hoare triple {3659#false} assume !false; {3659#false} is VALID [2018-11-23 12:09:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:09:39,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:39,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:39,628 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:09:39,665 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:09:39,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:39,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:39,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {3658#true} call ULTIMATE.init(); {3658#true} is VALID [2018-11-23 12:09:39,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {3658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3658#true} is VALID [2018-11-23 12:09:39,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {3658#true} assume true; {3658#true} is VALID [2018-11-23 12:09:39,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3658#true} {3658#true} #60#return; {3658#true} is VALID [2018-11-23 12:09:39,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {3658#true} call #t~ret4 := main(); {3658#true} is VALID [2018-11-23 12:09:39,780 INFO L273 TraceCheckUtils]: 5: Hoare triple {3658#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3658#true} is VALID [2018-11-23 12:09:39,780 INFO L273 TraceCheckUtils]: 6: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,781 INFO L273 TraceCheckUtils]: 9: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,781 INFO L273 TraceCheckUtils]: 10: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,782 INFO L273 TraceCheckUtils]: 19: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,782 INFO L273 TraceCheckUtils]: 20: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,782 INFO L273 TraceCheckUtils]: 21: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,782 INFO L273 TraceCheckUtils]: 22: Hoare triple {3658#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3658#true} is VALID [2018-11-23 12:09:39,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {3658#true} assume !(~i~0 < 100000); {3658#true} is VALID [2018-11-23 12:09:39,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {3658#true} ~i~0 := 1; {3661#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:39,805 INFO L273 TraceCheckUtils]: 25: Hoare triple {3661#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3669#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:39,806 INFO L273 TraceCheckUtils]: 26: Hoare triple {3669#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3677#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:39,807 INFO L273 TraceCheckUtils]: 27: Hoare triple {3677#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3762#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:39,808 INFO L273 TraceCheckUtils]: 28: Hoare triple {3762#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {3766#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:39,808 INFO L273 TraceCheckUtils]: 29: Hoare triple {3766#(<= main_~i~0 33)} assume !(~i~0 < 100000); {3659#false} is VALID [2018-11-23 12:09:39,808 INFO L273 TraceCheckUtils]: 30: Hoare triple {3659#false} ~i~0 := 1;~j~0 := 0; {3659#false} is VALID [2018-11-23 12:09:39,808 INFO L273 TraceCheckUtils]: 31: Hoare triple {3659#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {3659#false} is VALID [2018-11-23 12:09:39,808 INFO L256 TraceCheckUtils]: 32: Hoare triple {3659#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3659#false} is VALID [2018-11-23 12:09:39,809 INFO L273 TraceCheckUtils]: 33: Hoare triple {3659#false} ~cond := #in~cond; {3659#false} is VALID [2018-11-23 12:09:39,809 INFO L273 TraceCheckUtils]: 34: Hoare triple {3659#false} assume 0 == ~cond; {3659#false} is VALID [2018-11-23 12:09:39,809 INFO L273 TraceCheckUtils]: 35: Hoare triple {3659#false} assume !false; {3659#false} is VALID [2018-11-23 12:09:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 12:09:39,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:39,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 22 [2018-11-23 12:09:39,831 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-11-23 12:09:39,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:39,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:09:39,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:39,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:09:39,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:09:39,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:09:39,874 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 22 states. [2018-11-23 12:09:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:40,525 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-11-23 12:09:40,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:09:40,525 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-11-23 12:09:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:09:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 83 transitions. [2018-11-23 12:09:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:09:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 83 transitions. [2018-11-23 12:09:40,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 83 transitions. [2018-11-23 12:09:40,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:40,625 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:09:40,625 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:09:40,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:09:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:09:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2018-11-23 12:09:40,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:40,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 44 states. [2018-11-23 12:09:40,659 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 44 states. [2018-11-23 12:09:40,659 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 44 states. [2018-11-23 12:09:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:40,661 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-23 12:09:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-23 12:09:40,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:40,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:40,662 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 59 states. [2018-11-23 12:09:40,662 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 59 states. [2018-11-23 12:09:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:40,664 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-23 12:09:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-23 12:09:40,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:40,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:40,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:40,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:09:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-23 12:09:40,666 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2018-11-23 12:09:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:40,666 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-23 12:09:40,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:09:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 12:09:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:09:40,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:40,667 INFO L402 BasicCegarLoop]: trace histogram [20, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:40,667 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:40,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:40,668 INFO L82 PathProgramCache]: Analyzing trace with hash -463835735, now seen corresponding path program 13 times [2018-11-23 12:09:40,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:40,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:40,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:40,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:40,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:41,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {4110#true} call ULTIMATE.init(); {4110#true} is VALID [2018-11-23 12:09:41,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {4110#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4110#true} is VALID [2018-11-23 12:09:41,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {4110#true} assume true; {4110#true} is VALID [2018-11-23 12:09:41,943 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4110#true} {4110#true} #60#return; {4110#true} is VALID [2018-11-23 12:09:41,943 INFO L256 TraceCheckUtils]: 4: Hoare triple {4110#true} call #t~ret4 := main(); {4110#true} is VALID [2018-11-23 12:09:41,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {4110#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4112#(= main_~i~0 0)} is VALID [2018-11-23 12:09:41,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {4112#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4113#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:41,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {4113#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4114#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:41,946 INFO L273 TraceCheckUtils]: 8: Hoare triple {4114#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4115#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:41,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {4115#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4116#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:41,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {4116#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4117#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:41,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {4117#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4118#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:41,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {4118#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4119#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:41,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {4119#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4120#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:41,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {4120#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4121#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:41,953 INFO L273 TraceCheckUtils]: 15: Hoare triple {4121#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4122#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:41,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {4122#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4123#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:41,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {4123#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4124#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:41,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4125#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:41,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4126#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:41,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {4126#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4127#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:41,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {4127#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4128#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:41,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {4128#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4129#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:41,961 INFO L273 TraceCheckUtils]: 23: Hoare triple {4129#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4130#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:41,962 INFO L273 TraceCheckUtils]: 24: Hoare triple {4130#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4131#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:41,963 INFO L273 TraceCheckUtils]: 25: Hoare triple {4131#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4132#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:41,964 INFO L273 TraceCheckUtils]: 26: Hoare triple {4132#(<= main_~i~0 20)} assume !(~i~0 < 100000); {4111#false} is VALID [2018-11-23 12:09:41,964 INFO L273 TraceCheckUtils]: 27: Hoare triple {4111#false} ~i~0 := 1; {4111#false} is VALID [2018-11-23 12:09:41,965 INFO L273 TraceCheckUtils]: 28: Hoare triple {4111#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4111#false} is VALID [2018-11-23 12:09:41,965 INFO L273 TraceCheckUtils]: 29: Hoare triple {4111#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4111#false} is VALID [2018-11-23 12:09:41,965 INFO L273 TraceCheckUtils]: 30: Hoare triple {4111#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4111#false} is VALID [2018-11-23 12:09:41,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {4111#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4111#false} is VALID [2018-11-23 12:09:41,966 INFO L273 TraceCheckUtils]: 32: Hoare triple {4111#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4111#false} is VALID [2018-11-23 12:09:41,966 INFO L273 TraceCheckUtils]: 33: Hoare triple {4111#false} assume !(~i~0 < 100000); {4111#false} is VALID [2018-11-23 12:09:41,966 INFO L273 TraceCheckUtils]: 34: Hoare triple {4111#false} ~i~0 := 1;~j~0 := 0; {4111#false} is VALID [2018-11-23 12:09:41,966 INFO L273 TraceCheckUtils]: 35: Hoare triple {4111#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {4111#false} is VALID [2018-11-23 12:09:41,966 INFO L256 TraceCheckUtils]: 36: Hoare triple {4111#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4111#false} is VALID [2018-11-23 12:09:41,967 INFO L273 TraceCheckUtils]: 37: Hoare triple {4111#false} ~cond := #in~cond; {4111#false} is VALID [2018-11-23 12:09:41,967 INFO L273 TraceCheckUtils]: 38: Hoare triple {4111#false} assume 0 == ~cond; {4111#false} is VALID [2018-11-23 12:09:41,967 INFO L273 TraceCheckUtils]: 39: Hoare triple {4111#false} assume !false; {4111#false} is VALID [2018-11-23 12:09:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:09:41,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:41,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:41,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:42,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:42,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {4110#true} call ULTIMATE.init(); {4110#true} is VALID [2018-11-23 12:09:42,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {4110#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4110#true} is VALID [2018-11-23 12:09:42,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {4110#true} assume true; {4110#true} is VALID [2018-11-23 12:09:42,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4110#true} {4110#true} #60#return; {4110#true} is VALID [2018-11-23 12:09:42,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {4110#true} call #t~ret4 := main(); {4110#true} is VALID [2018-11-23 12:09:42,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {4110#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4151#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:42,272 INFO L273 TraceCheckUtils]: 6: Hoare triple {4151#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4113#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:42,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {4113#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4114#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:42,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {4114#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4115#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:42,274 INFO L273 TraceCheckUtils]: 9: Hoare triple {4115#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4116#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:42,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {4116#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4117#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:42,276 INFO L273 TraceCheckUtils]: 11: Hoare triple {4117#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4118#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:42,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {4118#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4119#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:42,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {4119#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4120#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:42,279 INFO L273 TraceCheckUtils]: 14: Hoare triple {4120#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4121#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:42,280 INFO L273 TraceCheckUtils]: 15: Hoare triple {4121#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4122#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:42,281 INFO L273 TraceCheckUtils]: 16: Hoare triple {4122#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4123#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:42,282 INFO L273 TraceCheckUtils]: 17: Hoare triple {4123#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4124#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:42,283 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4125#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:42,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4126#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:42,285 INFO L273 TraceCheckUtils]: 20: Hoare triple {4126#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4127#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:42,286 INFO L273 TraceCheckUtils]: 21: Hoare triple {4127#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4128#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:42,287 INFO L273 TraceCheckUtils]: 22: Hoare triple {4128#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4129#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:42,288 INFO L273 TraceCheckUtils]: 23: Hoare triple {4129#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4130#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:42,289 INFO L273 TraceCheckUtils]: 24: Hoare triple {4130#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4131#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:42,290 INFO L273 TraceCheckUtils]: 25: Hoare triple {4131#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4132#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:42,291 INFO L273 TraceCheckUtils]: 26: Hoare triple {4132#(<= main_~i~0 20)} assume !(~i~0 < 100000); {4111#false} is VALID [2018-11-23 12:09:42,291 INFO L273 TraceCheckUtils]: 27: Hoare triple {4111#false} ~i~0 := 1; {4111#false} is VALID [2018-11-23 12:09:42,291 INFO L273 TraceCheckUtils]: 28: Hoare triple {4111#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4111#false} is VALID [2018-11-23 12:09:42,292 INFO L273 TraceCheckUtils]: 29: Hoare triple {4111#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4111#false} is VALID [2018-11-23 12:09:42,292 INFO L273 TraceCheckUtils]: 30: Hoare triple {4111#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4111#false} is VALID [2018-11-23 12:09:42,292 INFO L273 TraceCheckUtils]: 31: Hoare triple {4111#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4111#false} is VALID [2018-11-23 12:09:42,292 INFO L273 TraceCheckUtils]: 32: Hoare triple {4111#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4111#false} is VALID [2018-11-23 12:09:42,293 INFO L273 TraceCheckUtils]: 33: Hoare triple {4111#false} assume !(~i~0 < 100000); {4111#false} is VALID [2018-11-23 12:09:42,293 INFO L273 TraceCheckUtils]: 34: Hoare triple {4111#false} ~i~0 := 1;~j~0 := 0; {4111#false} is VALID [2018-11-23 12:09:42,293 INFO L273 TraceCheckUtils]: 35: Hoare triple {4111#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {4111#false} is VALID [2018-11-23 12:09:42,293 INFO L256 TraceCheckUtils]: 36: Hoare triple {4111#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4111#false} is VALID [2018-11-23 12:09:42,293 INFO L273 TraceCheckUtils]: 37: Hoare triple {4111#false} ~cond := #in~cond; {4111#false} is VALID [2018-11-23 12:09:42,294 INFO L273 TraceCheckUtils]: 38: Hoare triple {4111#false} assume 0 == ~cond; {4111#false} is VALID [2018-11-23 12:09:42,294 INFO L273 TraceCheckUtils]: 39: Hoare triple {4111#false} assume !false; {4111#false} is VALID [2018-11-23 12:09:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:09:42,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:42,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:09:42,315 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2018-11-23 12:09:42,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:42,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:09:42,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:42,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:09:42,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:09:42,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:09:42,346 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 24 states. [2018-11-23 12:09:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:43,042 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2018-11-23 12:09:43,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:09:43,042 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2018-11-23 12:09:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:09:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 71 transitions. [2018-11-23 12:09:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:09:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 71 transitions. [2018-11-23 12:09:43,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 71 transitions. [2018-11-23 12:09:43,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:43,151 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:09:43,151 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:09:43,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:09:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:09:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-23 12:09:43,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:43,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 45 states. [2018-11-23 12:09:43,293 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 45 states. [2018-11-23 12:09:43,293 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 45 states. [2018-11-23 12:09:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:43,295 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-23 12:09:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 12:09:43,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:43,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:43,295 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 54 states. [2018-11-23 12:09:43,295 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 54 states. [2018-11-23 12:09:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:43,297 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-23 12:09:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 12:09:43,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:43,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:43,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:43,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:09:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-11-23 12:09:43,299 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 40 [2018-11-23 12:09:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:43,299 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-23 12:09:43,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:09:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 12:09:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:09:43,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:43,300 INFO L402 BasicCegarLoop]: trace histogram [21, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:43,300 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:43,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:43,301 INFO L82 PathProgramCache]: Analyzing trace with hash 782248453, now seen corresponding path program 14 times [2018-11-23 12:09:43,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:43,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:43,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:43,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:43,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:43,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {4562#true} call ULTIMATE.init(); {4562#true} is VALID [2018-11-23 12:09:43,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {4562#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4562#true} is VALID [2018-11-23 12:09:43,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {4562#true} assume true; {4562#true} is VALID [2018-11-23 12:09:43,973 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4562#true} {4562#true} #60#return; {4562#true} is VALID [2018-11-23 12:09:43,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {4562#true} call #t~ret4 := main(); {4562#true} is VALID [2018-11-23 12:09:43,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {4562#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4564#(= main_~i~0 0)} is VALID [2018-11-23 12:09:43,975 INFO L273 TraceCheckUtils]: 6: Hoare triple {4564#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4565#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:43,976 INFO L273 TraceCheckUtils]: 7: Hoare triple {4565#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4566#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:43,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {4566#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4567#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:43,977 INFO L273 TraceCheckUtils]: 9: Hoare triple {4567#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4568#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:43,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {4568#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4569#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:43,979 INFO L273 TraceCheckUtils]: 11: Hoare triple {4569#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4570#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:43,980 INFO L273 TraceCheckUtils]: 12: Hoare triple {4570#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4571#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:43,981 INFO L273 TraceCheckUtils]: 13: Hoare triple {4571#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4572#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:43,982 INFO L273 TraceCheckUtils]: 14: Hoare triple {4572#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4573#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:43,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {4573#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4574#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:43,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {4574#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4575#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:43,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {4575#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4576#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:43,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {4576#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4577#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:43,987 INFO L273 TraceCheckUtils]: 19: Hoare triple {4577#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4578#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:43,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {4578#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4579#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:44,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {4579#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4580#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:44,024 INFO L273 TraceCheckUtils]: 22: Hoare triple {4580#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4581#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:44,038 INFO L273 TraceCheckUtils]: 23: Hoare triple {4581#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4582#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:44,047 INFO L273 TraceCheckUtils]: 24: Hoare triple {4582#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4583#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:44,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {4583#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4584#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:44,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {4584#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4585#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:44,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {4585#(<= main_~i~0 21)} assume !(~i~0 < 100000); {4563#false} is VALID [2018-11-23 12:09:44,084 INFO L273 TraceCheckUtils]: 28: Hoare triple {4563#false} ~i~0 := 1; {4563#false} is VALID [2018-11-23 12:09:44,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {4563#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4563#false} is VALID [2018-11-23 12:09:44,084 INFO L273 TraceCheckUtils]: 30: Hoare triple {4563#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4563#false} is VALID [2018-11-23 12:09:44,084 INFO L273 TraceCheckUtils]: 31: Hoare triple {4563#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4563#false} is VALID [2018-11-23 12:09:44,085 INFO L273 TraceCheckUtils]: 32: Hoare triple {4563#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4563#false} is VALID [2018-11-23 12:09:44,085 INFO L273 TraceCheckUtils]: 33: Hoare triple {4563#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4563#false} is VALID [2018-11-23 12:09:44,085 INFO L273 TraceCheckUtils]: 34: Hoare triple {4563#false} assume !(~i~0 < 100000); {4563#false} is VALID [2018-11-23 12:09:44,085 INFO L273 TraceCheckUtils]: 35: Hoare triple {4563#false} ~i~0 := 1;~j~0 := 0; {4563#false} is VALID [2018-11-23 12:09:44,085 INFO L273 TraceCheckUtils]: 36: Hoare triple {4563#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {4563#false} is VALID [2018-11-23 12:09:44,085 INFO L256 TraceCheckUtils]: 37: Hoare triple {4563#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4563#false} is VALID [2018-11-23 12:09:44,086 INFO L273 TraceCheckUtils]: 38: Hoare triple {4563#false} ~cond := #in~cond; {4563#false} is VALID [2018-11-23 12:09:44,086 INFO L273 TraceCheckUtils]: 39: Hoare triple {4563#false} assume 0 == ~cond; {4563#false} is VALID [2018-11-23 12:09:44,086 INFO L273 TraceCheckUtils]: 40: Hoare triple {4563#false} assume !false; {4563#false} is VALID [2018-11-23 12:09:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:09:44,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:44,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:44,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:09:44,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:09:44,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:44,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:44,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {4562#true} call ULTIMATE.init(); {4562#true} is VALID [2018-11-23 12:09:44,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {4562#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4562#true} is VALID [2018-11-23 12:09:44,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {4562#true} assume true; {4562#true} is VALID [2018-11-23 12:09:44,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4562#true} {4562#true} #60#return; {4562#true} is VALID [2018-11-23 12:09:44,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {4562#true} call #t~ret4 := main(); {4562#true} is VALID [2018-11-23 12:09:44,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {4562#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4604#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:44,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {4604#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4565#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:44,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {4565#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4566#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:44,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {4566#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4567#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:44,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {4567#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4568#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:44,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {4568#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4569#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:44,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {4569#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4570#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:44,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {4570#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4571#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:44,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {4571#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4572#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:44,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {4572#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4573#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:44,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {4573#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4574#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:44,375 INFO L273 TraceCheckUtils]: 16: Hoare triple {4574#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4575#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:44,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {4575#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4576#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:44,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {4576#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4577#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:44,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {4577#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4578#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:44,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {4578#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4579#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:44,380 INFO L273 TraceCheckUtils]: 21: Hoare triple {4579#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4580#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:44,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {4580#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4581#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:44,382 INFO L273 TraceCheckUtils]: 23: Hoare triple {4581#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4582#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:44,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {4582#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4583#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:44,383 INFO L273 TraceCheckUtils]: 25: Hoare triple {4583#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4584#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:44,384 INFO L273 TraceCheckUtils]: 26: Hoare triple {4584#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4585#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:44,385 INFO L273 TraceCheckUtils]: 27: Hoare triple {4585#(<= main_~i~0 21)} assume !(~i~0 < 100000); {4563#false} is VALID [2018-11-23 12:09:44,385 INFO L273 TraceCheckUtils]: 28: Hoare triple {4563#false} ~i~0 := 1; {4563#false} is VALID [2018-11-23 12:09:44,386 INFO L273 TraceCheckUtils]: 29: Hoare triple {4563#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4563#false} is VALID [2018-11-23 12:09:44,386 INFO L273 TraceCheckUtils]: 30: Hoare triple {4563#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4563#false} is VALID [2018-11-23 12:09:44,386 INFO L273 TraceCheckUtils]: 31: Hoare triple {4563#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4563#false} is VALID [2018-11-23 12:09:44,386 INFO L273 TraceCheckUtils]: 32: Hoare triple {4563#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4563#false} is VALID [2018-11-23 12:09:44,386 INFO L273 TraceCheckUtils]: 33: Hoare triple {4563#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {4563#false} is VALID [2018-11-23 12:09:44,386 INFO L273 TraceCheckUtils]: 34: Hoare triple {4563#false} assume !(~i~0 < 100000); {4563#false} is VALID [2018-11-23 12:09:44,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {4563#false} ~i~0 := 1;~j~0 := 0; {4563#false} is VALID [2018-11-23 12:09:44,387 INFO L273 TraceCheckUtils]: 36: Hoare triple {4563#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {4563#false} is VALID [2018-11-23 12:09:44,387 INFO L256 TraceCheckUtils]: 37: Hoare triple {4563#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4563#false} is VALID [2018-11-23 12:09:44,387 INFO L273 TraceCheckUtils]: 38: Hoare triple {4563#false} ~cond := #in~cond; {4563#false} is VALID [2018-11-23 12:09:44,388 INFO L273 TraceCheckUtils]: 39: Hoare triple {4563#false} assume 0 == ~cond; {4563#false} is VALID [2018-11-23 12:09:44,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {4563#false} assume !false; {4563#false} is VALID [2018-11-23 12:09:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:09:44,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:44,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:09:44,408 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2018-11-23 12:09:44,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:44,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:09:44,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:44,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:09:44,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:09:44,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:09:44,439 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 25 states. [2018-11-23 12:09:44,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:44,943 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-23 12:09:44,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:09:44,943 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2018-11-23 12:09:44,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:09:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 72 transitions. [2018-11-23 12:09:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:09:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 72 transitions. [2018-11-23 12:09:44,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 72 transitions. [2018-11-23 12:09:45,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:45,881 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:09:45,881 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:09:45,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:09:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:09:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-11-23 12:09:46,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:46,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 46 states. [2018-11-23 12:09:46,779 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 46 states. [2018-11-23 12:09:46,780 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 46 states. [2018-11-23 12:09:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:46,782 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-11-23 12:09:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-11-23 12:09:46,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:46,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:46,783 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 55 states. [2018-11-23 12:09:46,783 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 55 states. [2018-11-23 12:09:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:46,785 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-11-23 12:09:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-11-23 12:09:46,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:46,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:46,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:46,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:09:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-23 12:09:46,788 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 41 [2018-11-23 12:09:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:46,788 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-23 12:09:46,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:09:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 12:09:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:09:46,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:46,789 INFO L402 BasicCegarLoop]: trace histogram [22, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:46,790 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:46,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:46,790 INFO L82 PathProgramCache]: Analyzing trace with hash 756152617, now seen corresponding path program 15 times [2018-11-23 12:09:46,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:46,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:46,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:46,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:46,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:47,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {5024#true} call ULTIMATE.init(); {5024#true} is VALID [2018-11-23 12:09:47,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {5024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5024#true} is VALID [2018-11-23 12:09:47,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {5024#true} assume true; {5024#true} is VALID [2018-11-23 12:09:47,505 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5024#true} {5024#true} #60#return; {5024#true} is VALID [2018-11-23 12:09:47,505 INFO L256 TraceCheckUtils]: 4: Hoare triple {5024#true} call #t~ret4 := main(); {5024#true} is VALID [2018-11-23 12:09:47,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {5024#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5026#(= main_~i~0 0)} is VALID [2018-11-23 12:09:47,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {5026#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5027#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:47,507 INFO L273 TraceCheckUtils]: 7: Hoare triple {5027#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5028#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:47,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {5028#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5029#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:47,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {5029#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5030#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:47,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {5030#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5031#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:47,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {5031#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5032#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:47,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {5032#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5033#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:47,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {5033#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5034#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:47,513 INFO L273 TraceCheckUtils]: 14: Hoare triple {5034#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5035#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:47,514 INFO L273 TraceCheckUtils]: 15: Hoare triple {5035#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5036#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:47,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {5036#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5037#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:47,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {5037#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5038#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:47,518 INFO L273 TraceCheckUtils]: 18: Hoare triple {5038#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5039#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:47,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {5039#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5040#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:47,520 INFO L273 TraceCheckUtils]: 20: Hoare triple {5040#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5041#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:47,521 INFO L273 TraceCheckUtils]: 21: Hoare triple {5041#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5042#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:47,522 INFO L273 TraceCheckUtils]: 22: Hoare triple {5042#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5043#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:47,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {5043#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5044#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:47,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {5044#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5045#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:47,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {5045#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5046#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:47,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {5046#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5047#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:47,528 INFO L273 TraceCheckUtils]: 27: Hoare triple {5047#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5048#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:47,529 INFO L273 TraceCheckUtils]: 28: Hoare triple {5048#(<= main_~i~0 22)} assume !(~i~0 < 100000); {5025#false} is VALID [2018-11-23 12:09:47,529 INFO L273 TraceCheckUtils]: 29: Hoare triple {5025#false} ~i~0 := 1; {5025#false} is VALID [2018-11-23 12:09:47,530 INFO L273 TraceCheckUtils]: 30: Hoare triple {5025#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5025#false} is VALID [2018-11-23 12:09:47,530 INFO L273 TraceCheckUtils]: 31: Hoare triple {5025#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5025#false} is VALID [2018-11-23 12:09:47,530 INFO L273 TraceCheckUtils]: 32: Hoare triple {5025#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5025#false} is VALID [2018-11-23 12:09:47,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {5025#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5025#false} is VALID [2018-11-23 12:09:47,531 INFO L273 TraceCheckUtils]: 34: Hoare triple {5025#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5025#false} is VALID [2018-11-23 12:09:47,531 INFO L273 TraceCheckUtils]: 35: Hoare triple {5025#false} assume !(~i~0 < 100000); {5025#false} is VALID [2018-11-23 12:09:47,531 INFO L273 TraceCheckUtils]: 36: Hoare triple {5025#false} ~i~0 := 1;~j~0 := 0; {5025#false} is VALID [2018-11-23 12:09:47,531 INFO L273 TraceCheckUtils]: 37: Hoare triple {5025#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {5025#false} is VALID [2018-11-23 12:09:47,532 INFO L256 TraceCheckUtils]: 38: Hoare triple {5025#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5025#false} is VALID [2018-11-23 12:09:47,532 INFO L273 TraceCheckUtils]: 39: Hoare triple {5025#false} ~cond := #in~cond; {5025#false} is VALID [2018-11-23 12:09:47,532 INFO L273 TraceCheckUtils]: 40: Hoare triple {5025#false} assume 0 == ~cond; {5025#false} is VALID [2018-11-23 12:09:47,532 INFO L273 TraceCheckUtils]: 41: Hoare triple {5025#false} assume !false; {5025#false} is VALID [2018-11-23 12:09:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:09:47,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:47,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:47,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:09:47,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:09:47,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:47,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:47,877 INFO L256 TraceCheckUtils]: 0: Hoare triple {5024#true} call ULTIMATE.init(); {5024#true} is VALID [2018-11-23 12:09:47,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {5024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5024#true} is VALID [2018-11-23 12:09:47,877 INFO L273 TraceCheckUtils]: 2: Hoare triple {5024#true} assume true; {5024#true} is VALID [2018-11-23 12:09:47,878 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5024#true} {5024#true} #60#return; {5024#true} is VALID [2018-11-23 12:09:47,878 INFO L256 TraceCheckUtils]: 4: Hoare triple {5024#true} call #t~ret4 := main(); {5024#true} is VALID [2018-11-23 12:09:47,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {5024#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5024#true} is VALID [2018-11-23 12:09:47,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,879 INFO L273 TraceCheckUtils]: 17: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,880 INFO L273 TraceCheckUtils]: 18: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,880 INFO L273 TraceCheckUtils]: 21: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,880 INFO L273 TraceCheckUtils]: 22: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,880 INFO L273 TraceCheckUtils]: 23: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {5024#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5024#true} is VALID [2018-11-23 12:09:47,881 INFO L273 TraceCheckUtils]: 28: Hoare triple {5024#true} assume !(~i~0 < 100000); {5024#true} is VALID [2018-11-23 12:09:47,882 INFO L273 TraceCheckUtils]: 29: Hoare triple {5024#true} ~i~0 := 1; {5027#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:47,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {5027#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5035#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:47,883 INFO L273 TraceCheckUtils]: 31: Hoare triple {5035#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5043#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:47,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {5043#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5148#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:47,885 INFO L273 TraceCheckUtils]: 33: Hoare triple {5148#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5152#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:47,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {5152#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5156#(<= main_~i~0 41)} is VALID [2018-11-23 12:09:47,887 INFO L273 TraceCheckUtils]: 35: Hoare triple {5156#(<= main_~i~0 41)} assume !(~i~0 < 100000); {5025#false} is VALID [2018-11-23 12:09:47,887 INFO L273 TraceCheckUtils]: 36: Hoare triple {5025#false} ~i~0 := 1;~j~0 := 0; {5025#false} is VALID [2018-11-23 12:09:47,887 INFO L273 TraceCheckUtils]: 37: Hoare triple {5025#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {5025#false} is VALID [2018-11-23 12:09:47,887 INFO L256 TraceCheckUtils]: 38: Hoare triple {5025#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5025#false} is VALID [2018-11-23 12:09:47,888 INFO L273 TraceCheckUtils]: 39: Hoare triple {5025#false} ~cond := #in~cond; {5025#false} is VALID [2018-11-23 12:09:47,888 INFO L273 TraceCheckUtils]: 40: Hoare triple {5025#false} assume 0 == ~cond; {5025#false} is VALID [2018-11-23 12:09:47,888 INFO L273 TraceCheckUtils]: 41: Hoare triple {5025#false} assume !false; {5025#false} is VALID [2018-11-23 12:09:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:09:47,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:47,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 28 [2018-11-23 12:09:47,913 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 42 [2018-11-23 12:09:47,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:47,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:09:47,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:47,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:09:47,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:09:47,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:09:47,997 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 28 states. [2018-11-23 12:09:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:48,686 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-11-23 12:09:48,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:09:48,686 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 42 [2018-11-23 12:09:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:09:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 95 transitions. [2018-11-23 12:09:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:09:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 95 transitions. [2018-11-23 12:09:48,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 95 transitions. [2018-11-23 12:09:49,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:49,188 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:09:49,188 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:09:49,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:09:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:09:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-11-23 12:09:49,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:49,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 51 states. [2018-11-23 12:09:49,228 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 51 states. [2018-11-23 12:09:49,228 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 51 states. [2018-11-23 12:09:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:49,231 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-23 12:09:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-11-23 12:09:49,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:49,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:49,232 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 69 states. [2018-11-23 12:09:49,232 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 69 states. [2018-11-23 12:09:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:49,234 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-23 12:09:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-11-23 12:09:49,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:49,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:49,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:49,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:09:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-23 12:09:49,236 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 42 [2018-11-23 12:09:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:49,236 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-23 12:09:49,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:09:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-23 12:09:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:09:49,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:49,237 INFO L402 BasicCegarLoop]: trace histogram [26, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:49,238 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:49,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:49,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1141401786, now seen corresponding path program 16 times [2018-11-23 12:09:49,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:49,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:49,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:49,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:49,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:50,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {5555#true} call ULTIMATE.init(); {5555#true} is VALID [2018-11-23 12:09:50,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {5555#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5555#true} is VALID [2018-11-23 12:09:50,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {5555#true} assume true; {5555#true} is VALID [2018-11-23 12:09:50,671 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5555#true} {5555#true} #60#return; {5555#true} is VALID [2018-11-23 12:09:50,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {5555#true} call #t~ret4 := main(); {5555#true} is VALID [2018-11-23 12:09:50,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {5555#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5557#(= main_~i~0 0)} is VALID [2018-11-23 12:09:50,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {5557#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5558#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:50,674 INFO L273 TraceCheckUtils]: 7: Hoare triple {5558#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5559#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:50,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {5559#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5560#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:50,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {5560#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5561#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:50,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {5561#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5562#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:50,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {5562#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5563#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:50,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {5563#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5564#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:50,681 INFO L273 TraceCheckUtils]: 13: Hoare triple {5564#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5565#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:50,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {5565#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5566#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:50,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {5566#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5567#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:50,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {5567#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5568#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:50,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {5568#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5569#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:50,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {5569#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5570#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:50,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {5570#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5571#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:50,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {5571#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5572#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:50,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {5572#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5573#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:50,690 INFO L273 TraceCheckUtils]: 22: Hoare triple {5573#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5574#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:50,691 INFO L273 TraceCheckUtils]: 23: Hoare triple {5574#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5575#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:50,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {5575#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5576#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:50,693 INFO L273 TraceCheckUtils]: 25: Hoare triple {5576#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5577#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:50,694 INFO L273 TraceCheckUtils]: 26: Hoare triple {5577#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5578#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:50,695 INFO L273 TraceCheckUtils]: 27: Hoare triple {5578#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5579#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:50,696 INFO L273 TraceCheckUtils]: 28: Hoare triple {5579#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5580#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:50,697 INFO L273 TraceCheckUtils]: 29: Hoare triple {5580#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5581#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:50,698 INFO L273 TraceCheckUtils]: 30: Hoare triple {5581#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5582#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:50,699 INFO L273 TraceCheckUtils]: 31: Hoare triple {5582#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5583#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:50,700 INFO L273 TraceCheckUtils]: 32: Hoare triple {5583#(<= main_~i~0 26)} assume !(~i~0 < 100000); {5556#false} is VALID [2018-11-23 12:09:50,700 INFO L273 TraceCheckUtils]: 33: Hoare triple {5556#false} ~i~0 := 1; {5556#false} is VALID [2018-11-23 12:09:50,700 INFO L273 TraceCheckUtils]: 34: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5556#false} is VALID [2018-11-23 12:09:50,700 INFO L273 TraceCheckUtils]: 35: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5556#false} is VALID [2018-11-23 12:09:50,700 INFO L273 TraceCheckUtils]: 36: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5556#false} is VALID [2018-11-23 12:09:50,701 INFO L273 TraceCheckUtils]: 37: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5556#false} is VALID [2018-11-23 12:09:50,701 INFO L273 TraceCheckUtils]: 38: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5556#false} is VALID [2018-11-23 12:09:50,701 INFO L273 TraceCheckUtils]: 39: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5556#false} is VALID [2018-11-23 12:09:50,701 INFO L273 TraceCheckUtils]: 40: Hoare triple {5556#false} assume !(~i~0 < 100000); {5556#false} is VALID [2018-11-23 12:09:50,701 INFO L273 TraceCheckUtils]: 41: Hoare triple {5556#false} ~i~0 := 1;~j~0 := 0; {5556#false} is VALID [2018-11-23 12:09:50,702 INFO L273 TraceCheckUtils]: 42: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {5556#false} is VALID [2018-11-23 12:09:50,702 INFO L256 TraceCheckUtils]: 43: Hoare triple {5556#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5556#false} is VALID [2018-11-23 12:09:50,702 INFO L273 TraceCheckUtils]: 44: Hoare triple {5556#false} ~cond := #in~cond; {5556#false} is VALID [2018-11-23 12:09:50,702 INFO L273 TraceCheckUtils]: 45: Hoare triple {5556#false} assume 0 == ~cond; {5556#false} is VALID [2018-11-23 12:09:50,702 INFO L273 TraceCheckUtils]: 46: Hoare triple {5556#false} assume !false; {5556#false} is VALID [2018-11-23 12:09:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:09:50,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:50,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:50,712 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:09:50,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:09:50,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:50,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:50,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {5555#true} call ULTIMATE.init(); {5555#true} is VALID [2018-11-23 12:09:50,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {5555#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5555#true} is VALID [2018-11-23 12:09:50,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {5555#true} assume true; {5555#true} is VALID [2018-11-23 12:09:50,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5555#true} {5555#true} #60#return; {5555#true} is VALID [2018-11-23 12:09:50,981 INFO L256 TraceCheckUtils]: 4: Hoare triple {5555#true} call #t~ret4 := main(); {5555#true} is VALID [2018-11-23 12:09:50,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {5555#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5602#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:50,982 INFO L273 TraceCheckUtils]: 6: Hoare triple {5602#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5558#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:50,982 INFO L273 TraceCheckUtils]: 7: Hoare triple {5558#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5559#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:50,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {5559#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5560#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:50,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {5560#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5561#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:50,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {5561#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5562#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:50,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {5562#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5563#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:50,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {5563#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5564#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:50,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {5564#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5565#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:50,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {5565#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5566#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:50,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {5566#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5567#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:50,990 INFO L273 TraceCheckUtils]: 16: Hoare triple {5567#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5568#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:50,991 INFO L273 TraceCheckUtils]: 17: Hoare triple {5568#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5569#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:50,992 INFO L273 TraceCheckUtils]: 18: Hoare triple {5569#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5570#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:50,993 INFO L273 TraceCheckUtils]: 19: Hoare triple {5570#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5571#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:50,994 INFO L273 TraceCheckUtils]: 20: Hoare triple {5571#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5572#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:50,995 INFO L273 TraceCheckUtils]: 21: Hoare triple {5572#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5573#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:50,996 INFO L273 TraceCheckUtils]: 22: Hoare triple {5573#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5574#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:50,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {5574#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5575#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:50,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {5575#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5576#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:50,999 INFO L273 TraceCheckUtils]: 25: Hoare triple {5576#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5577#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:51,000 INFO L273 TraceCheckUtils]: 26: Hoare triple {5577#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5578#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:51,001 INFO L273 TraceCheckUtils]: 27: Hoare triple {5578#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5579#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:51,002 INFO L273 TraceCheckUtils]: 28: Hoare triple {5579#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5580#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:51,003 INFO L273 TraceCheckUtils]: 29: Hoare triple {5580#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5581#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:51,004 INFO L273 TraceCheckUtils]: 30: Hoare triple {5581#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5582#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:51,005 INFO L273 TraceCheckUtils]: 31: Hoare triple {5582#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5583#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:51,005 INFO L273 TraceCheckUtils]: 32: Hoare triple {5583#(<= main_~i~0 26)} assume !(~i~0 < 100000); {5556#false} is VALID [2018-11-23 12:09:51,006 INFO L273 TraceCheckUtils]: 33: Hoare triple {5556#false} ~i~0 := 1; {5556#false} is VALID [2018-11-23 12:09:51,006 INFO L273 TraceCheckUtils]: 34: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5556#false} is VALID [2018-11-23 12:09:51,006 INFO L273 TraceCheckUtils]: 35: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5556#false} is VALID [2018-11-23 12:09:51,006 INFO L273 TraceCheckUtils]: 36: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5556#false} is VALID [2018-11-23 12:09:51,006 INFO L273 TraceCheckUtils]: 37: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5556#false} is VALID [2018-11-23 12:09:51,007 INFO L273 TraceCheckUtils]: 38: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5556#false} is VALID [2018-11-23 12:09:51,007 INFO L273 TraceCheckUtils]: 39: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {5556#false} is VALID [2018-11-23 12:09:51,007 INFO L273 TraceCheckUtils]: 40: Hoare triple {5556#false} assume !(~i~0 < 100000); {5556#false} is VALID [2018-11-23 12:09:51,007 INFO L273 TraceCheckUtils]: 41: Hoare triple {5556#false} ~i~0 := 1;~j~0 := 0; {5556#false} is VALID [2018-11-23 12:09:51,007 INFO L273 TraceCheckUtils]: 42: Hoare triple {5556#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {5556#false} is VALID [2018-11-23 12:09:51,008 INFO L256 TraceCheckUtils]: 43: Hoare triple {5556#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5556#false} is VALID [2018-11-23 12:09:51,008 INFO L273 TraceCheckUtils]: 44: Hoare triple {5556#false} ~cond := #in~cond; {5556#false} is VALID [2018-11-23 12:09:51,008 INFO L273 TraceCheckUtils]: 45: Hoare triple {5556#false} assume 0 == ~cond; {5556#false} is VALID [2018-11-23 12:09:51,008 INFO L273 TraceCheckUtils]: 46: Hoare triple {5556#false} assume !false; {5556#false} is VALID [2018-11-23 12:09:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:09:51,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:51,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:09:51,030 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 47 [2018-11-23 12:09:51,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:51,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:09:51,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:51,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:09:51,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:09:51,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:09:51,063 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 30 states. [2018-11-23 12:09:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:51,905 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-11-23 12:09:51,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:09:51,906 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 47 [2018-11-23 12:09:51,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:09:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 82 transitions. [2018-11-23 12:09:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:09:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 82 transitions. [2018-11-23 12:09:51,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 82 transitions. [2018-11-23 12:09:52,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:52,400 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:09:52,400 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:09:52,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:09:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:09:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2018-11-23 12:09:52,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:52,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 52 states. [2018-11-23 12:09:52,458 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 52 states. [2018-11-23 12:09:52,458 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 52 states. [2018-11-23 12:09:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:52,460 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-23 12:09:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-23 12:09:52,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:52,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:52,461 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 64 states. [2018-11-23 12:09:52,461 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 64 states. [2018-11-23 12:09:52,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:52,462 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-23 12:09:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-23 12:09:52,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:52,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:52,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:52,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:09:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-11-23 12:09:52,464 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2018-11-23 12:09:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:52,465 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-23 12:09:52,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:09:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 12:09:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:09:52,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:52,466 INFO L402 BasicCegarLoop]: trace histogram [27, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:52,466 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:52,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:52,466 INFO L82 PathProgramCache]: Analyzing trace with hash -67994774, now seen corresponding path program 17 times [2018-11-23 12:09:52,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:52,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:52,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:52,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:52,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:53,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {6089#true} call ULTIMATE.init(); {6089#true} is VALID [2018-11-23 12:09:53,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {6089#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6089#true} is VALID [2018-11-23 12:09:53,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {6089#true} assume true; {6089#true} is VALID [2018-11-23 12:09:53,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6089#true} {6089#true} #60#return; {6089#true} is VALID [2018-11-23 12:09:53,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {6089#true} call #t~ret4 := main(); {6089#true} is VALID [2018-11-23 12:09:53,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {6089#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {6091#(= main_~i~0 0)} is VALID [2018-11-23 12:09:53,008 INFO L273 TraceCheckUtils]: 6: Hoare triple {6091#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6092#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:53,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {6092#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6093#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:53,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {6093#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6094#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:53,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {6094#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6095#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:53,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {6095#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6096#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:53,016 INFO L273 TraceCheckUtils]: 11: Hoare triple {6096#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6097#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:53,016 INFO L273 TraceCheckUtils]: 12: Hoare triple {6097#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6098#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:53,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {6098#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6099#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:53,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {6099#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6100#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:53,022 INFO L273 TraceCheckUtils]: 15: Hoare triple {6100#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6101#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:53,022 INFO L273 TraceCheckUtils]: 16: Hoare triple {6101#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6102#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:53,024 INFO L273 TraceCheckUtils]: 17: Hoare triple {6102#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6103#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:53,025 INFO L273 TraceCheckUtils]: 18: Hoare triple {6103#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6104#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:53,026 INFO L273 TraceCheckUtils]: 19: Hoare triple {6104#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6105#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:53,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {6105#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6106#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:53,028 INFO L273 TraceCheckUtils]: 21: Hoare triple {6106#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6107#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:53,028 INFO L273 TraceCheckUtils]: 22: Hoare triple {6107#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6108#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:53,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {6108#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6109#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:53,031 INFO L273 TraceCheckUtils]: 24: Hoare triple {6109#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6110#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:53,033 INFO L273 TraceCheckUtils]: 25: Hoare triple {6110#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6111#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:53,034 INFO L273 TraceCheckUtils]: 26: Hoare triple {6111#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6112#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:53,035 INFO L273 TraceCheckUtils]: 27: Hoare triple {6112#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6113#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:53,036 INFO L273 TraceCheckUtils]: 28: Hoare triple {6113#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6114#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:53,037 INFO L273 TraceCheckUtils]: 29: Hoare triple {6114#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6115#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:53,038 INFO L273 TraceCheckUtils]: 30: Hoare triple {6115#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6116#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:53,039 INFO L273 TraceCheckUtils]: 31: Hoare triple {6116#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6117#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:53,040 INFO L273 TraceCheckUtils]: 32: Hoare triple {6117#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6118#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:53,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {6118#(<= main_~i~0 27)} assume !(~i~0 < 100000); {6090#false} is VALID [2018-11-23 12:09:53,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {6090#false} ~i~0 := 1; {6090#false} is VALID [2018-11-23 12:09:53,041 INFO L273 TraceCheckUtils]: 35: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6090#false} is VALID [2018-11-23 12:09:53,041 INFO L273 TraceCheckUtils]: 36: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6090#false} is VALID [2018-11-23 12:09:53,042 INFO L273 TraceCheckUtils]: 37: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6090#false} is VALID [2018-11-23 12:09:53,042 INFO L273 TraceCheckUtils]: 38: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6090#false} is VALID [2018-11-23 12:09:53,042 INFO L273 TraceCheckUtils]: 39: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6090#false} is VALID [2018-11-23 12:09:53,042 INFO L273 TraceCheckUtils]: 40: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6090#false} is VALID [2018-11-23 12:09:53,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {6090#false} assume !(~i~0 < 100000); {6090#false} is VALID [2018-11-23 12:09:53,043 INFO L273 TraceCheckUtils]: 42: Hoare triple {6090#false} ~i~0 := 1;~j~0 := 0; {6090#false} is VALID [2018-11-23 12:09:53,043 INFO L273 TraceCheckUtils]: 43: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {6090#false} is VALID [2018-11-23 12:09:53,043 INFO L256 TraceCheckUtils]: 44: Hoare triple {6090#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6090#false} is VALID [2018-11-23 12:09:53,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {6090#false} ~cond := #in~cond; {6090#false} is VALID [2018-11-23 12:09:53,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {6090#false} assume 0 == ~cond; {6090#false} is VALID [2018-11-23 12:09:53,044 INFO L273 TraceCheckUtils]: 47: Hoare triple {6090#false} assume !false; {6090#false} is VALID [2018-11-23 12:09:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:09:53,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:53,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:53,055 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:09:58,112 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-11-23 12:09:58,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:58,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:58,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {6089#true} call ULTIMATE.init(); {6089#true} is VALID [2018-11-23 12:09:58,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {6089#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6089#true} is VALID [2018-11-23 12:09:58,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {6089#true} assume true; {6089#true} is VALID [2018-11-23 12:09:58,536 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6089#true} {6089#true} #60#return; {6089#true} is VALID [2018-11-23 12:09:58,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {6089#true} call #t~ret4 := main(); {6089#true} is VALID [2018-11-23 12:09:58,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {6089#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {6137#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:58,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {6137#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6092#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:58,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {6092#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6093#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:58,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {6093#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6094#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:58,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {6094#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6095#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:58,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {6095#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6096#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:58,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {6096#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6097#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:58,543 INFO L273 TraceCheckUtils]: 12: Hoare triple {6097#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6098#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:58,544 INFO L273 TraceCheckUtils]: 13: Hoare triple {6098#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6099#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:58,544 INFO L273 TraceCheckUtils]: 14: Hoare triple {6099#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6100#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:58,545 INFO L273 TraceCheckUtils]: 15: Hoare triple {6100#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6101#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:58,546 INFO L273 TraceCheckUtils]: 16: Hoare triple {6101#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6102#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:58,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {6102#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6103#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:58,548 INFO L273 TraceCheckUtils]: 18: Hoare triple {6103#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6104#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:58,549 INFO L273 TraceCheckUtils]: 19: Hoare triple {6104#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6105#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:58,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {6105#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6106#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:58,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {6106#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6107#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:58,552 INFO L273 TraceCheckUtils]: 22: Hoare triple {6107#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6108#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:58,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {6108#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6109#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:58,554 INFO L273 TraceCheckUtils]: 24: Hoare triple {6109#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6110#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:58,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {6110#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6111#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:58,556 INFO L273 TraceCheckUtils]: 26: Hoare triple {6111#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6112#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:58,557 INFO L273 TraceCheckUtils]: 27: Hoare triple {6112#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6113#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:58,558 INFO L273 TraceCheckUtils]: 28: Hoare triple {6113#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6114#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:58,559 INFO L273 TraceCheckUtils]: 29: Hoare triple {6114#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6115#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:58,560 INFO L273 TraceCheckUtils]: 30: Hoare triple {6115#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6116#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:58,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {6116#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6117#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:58,562 INFO L273 TraceCheckUtils]: 32: Hoare triple {6117#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6118#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:58,562 INFO L273 TraceCheckUtils]: 33: Hoare triple {6118#(<= main_~i~0 27)} assume !(~i~0 < 100000); {6090#false} is VALID [2018-11-23 12:09:58,563 INFO L273 TraceCheckUtils]: 34: Hoare triple {6090#false} ~i~0 := 1; {6090#false} is VALID [2018-11-23 12:09:58,563 INFO L273 TraceCheckUtils]: 35: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6090#false} is VALID [2018-11-23 12:09:58,563 INFO L273 TraceCheckUtils]: 36: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6090#false} is VALID [2018-11-23 12:09:58,563 INFO L273 TraceCheckUtils]: 37: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6090#false} is VALID [2018-11-23 12:09:58,563 INFO L273 TraceCheckUtils]: 38: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6090#false} is VALID [2018-11-23 12:09:58,564 INFO L273 TraceCheckUtils]: 39: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6090#false} is VALID [2018-11-23 12:09:58,564 INFO L273 TraceCheckUtils]: 40: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6090#false} is VALID [2018-11-23 12:09:58,564 INFO L273 TraceCheckUtils]: 41: Hoare triple {6090#false} assume !(~i~0 < 100000); {6090#false} is VALID [2018-11-23 12:09:58,564 INFO L273 TraceCheckUtils]: 42: Hoare triple {6090#false} ~i~0 := 1;~j~0 := 0; {6090#false} is VALID [2018-11-23 12:09:58,564 INFO L273 TraceCheckUtils]: 43: Hoare triple {6090#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {6090#false} is VALID [2018-11-23 12:09:58,565 INFO L256 TraceCheckUtils]: 44: Hoare triple {6090#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6090#false} is VALID [2018-11-23 12:09:58,565 INFO L273 TraceCheckUtils]: 45: Hoare triple {6090#false} ~cond := #in~cond; {6090#false} is VALID [2018-11-23 12:09:58,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {6090#false} assume 0 == ~cond; {6090#false} is VALID [2018-11-23 12:09:58,565 INFO L273 TraceCheckUtils]: 47: Hoare triple {6090#false} assume !false; {6090#false} is VALID [2018-11-23 12:09:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:09:58,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:58,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 12:09:58,590 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 48 [2018-11-23 12:09:58,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:58,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:09:58,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:58,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:09:58,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:09:58,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:09:58,624 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 31 states. [2018-11-23 12:09:59,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:59,445 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-11-23 12:09:59,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:09:59,446 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 48 [2018-11-23 12:09:59,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:09:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 83 transitions. [2018-11-23 12:09:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:09:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 83 transitions. [2018-11-23 12:09:59,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 83 transitions. [2018-11-23 12:09:59,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:59,557 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:09:59,557 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:09:59,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:09:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:09:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-11-23 12:09:59,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:59,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 53 states. [2018-11-23 12:09:59,599 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 53 states. [2018-11-23 12:09:59,599 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 53 states. [2018-11-23 12:09:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:59,600 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-11-23 12:09:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-11-23 12:09:59,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:59,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:59,601 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 65 states. [2018-11-23 12:09:59,601 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 65 states. [2018-11-23 12:09:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:59,602 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-11-23 12:09:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-11-23 12:09:59,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:59,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:59,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:59,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:09:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-11-23 12:09:59,605 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 48 [2018-11-23 12:09:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:59,605 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-23 12:09:59,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:09:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-23 12:09:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:09:59,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:59,606 INFO L402 BasicCegarLoop]: trace histogram [28, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:59,606 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:59,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:59,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1152115770, now seen corresponding path program 18 times [2018-11-23 12:09:59,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:59,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:59,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:59,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:59,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:01,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {6633#true} call ULTIMATE.init(); {6633#true} is VALID [2018-11-23 12:10:01,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {6633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6633#true} is VALID [2018-11-23 12:10:01,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {6633#true} assume true; {6633#true} is VALID [2018-11-23 12:10:01,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6633#true} {6633#true} #60#return; {6633#true} is VALID [2018-11-23 12:10:01,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {6633#true} call #t~ret4 := main(); {6633#true} is VALID [2018-11-23 12:10:01,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {6633#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {6635#(= main_~i~0 0)} is VALID [2018-11-23 12:10:01,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {6635#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6636#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:01,391 INFO L273 TraceCheckUtils]: 7: Hoare triple {6636#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6637#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:01,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {6637#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6638#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:01,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {6638#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6639#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:01,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {6639#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6640#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:01,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {6640#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6641#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:01,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {6641#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6642#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:01,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {6642#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6643#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:01,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {6643#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6644#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:01,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {6644#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6645#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:01,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {6645#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6646#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:01,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {6646#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6647#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:01,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {6647#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6648#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:01,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {6648#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6649#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:01,402 INFO L273 TraceCheckUtils]: 20: Hoare triple {6649#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6650#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:01,403 INFO L273 TraceCheckUtils]: 21: Hoare triple {6650#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6651#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:01,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {6651#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6652#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:01,405 INFO L273 TraceCheckUtils]: 23: Hoare triple {6652#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6653#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:01,406 INFO L273 TraceCheckUtils]: 24: Hoare triple {6653#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6654#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:01,407 INFO L273 TraceCheckUtils]: 25: Hoare triple {6654#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6655#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:01,408 INFO L273 TraceCheckUtils]: 26: Hoare triple {6655#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6656#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:01,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {6656#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6657#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:01,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {6657#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6658#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:01,411 INFO L273 TraceCheckUtils]: 29: Hoare triple {6658#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6659#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:01,412 INFO L273 TraceCheckUtils]: 30: Hoare triple {6659#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6660#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:01,413 INFO L273 TraceCheckUtils]: 31: Hoare triple {6660#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6661#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:01,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {6661#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6662#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:01,415 INFO L273 TraceCheckUtils]: 33: Hoare triple {6662#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6663#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:01,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {6663#(<= main_~i~0 28)} assume !(~i~0 < 100000); {6634#false} is VALID [2018-11-23 12:10:01,416 INFO L273 TraceCheckUtils]: 35: Hoare triple {6634#false} ~i~0 := 1; {6634#false} is VALID [2018-11-23 12:10:01,416 INFO L273 TraceCheckUtils]: 36: Hoare triple {6634#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6634#false} is VALID [2018-11-23 12:10:01,416 INFO L273 TraceCheckUtils]: 37: Hoare triple {6634#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6634#false} is VALID [2018-11-23 12:10:01,416 INFO L273 TraceCheckUtils]: 38: Hoare triple {6634#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6634#false} is VALID [2018-11-23 12:10:01,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {6634#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6634#false} is VALID [2018-11-23 12:10:01,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {6634#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6634#false} is VALID [2018-11-23 12:10:01,417 INFO L273 TraceCheckUtils]: 41: Hoare triple {6634#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6634#false} is VALID [2018-11-23 12:10:01,417 INFO L273 TraceCheckUtils]: 42: Hoare triple {6634#false} assume !(~i~0 < 100000); {6634#false} is VALID [2018-11-23 12:10:01,417 INFO L273 TraceCheckUtils]: 43: Hoare triple {6634#false} ~i~0 := 1;~j~0 := 0; {6634#false} is VALID [2018-11-23 12:10:01,417 INFO L273 TraceCheckUtils]: 44: Hoare triple {6634#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {6634#false} is VALID [2018-11-23 12:10:01,418 INFO L256 TraceCheckUtils]: 45: Hoare triple {6634#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6634#false} is VALID [2018-11-23 12:10:01,418 INFO L273 TraceCheckUtils]: 46: Hoare triple {6634#false} ~cond := #in~cond; {6634#false} is VALID [2018-11-23 12:10:01,418 INFO L273 TraceCheckUtils]: 47: Hoare triple {6634#false} assume 0 == ~cond; {6634#false} is VALID [2018-11-23 12:10:01,418 INFO L273 TraceCheckUtils]: 48: Hoare triple {6634#false} assume !false; {6634#false} is VALID [2018-11-23 12:10:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:10:01,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:01,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:01,430 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:10:01,778 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:10:01,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:01,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:01,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {6633#true} call ULTIMATE.init(); {6633#true} is VALID [2018-11-23 12:10:01,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {6633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6633#true} is VALID [2018-11-23 12:10:01,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {6633#true} assume true; {6633#true} is VALID [2018-11-23 12:10:01,944 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6633#true} {6633#true} #60#return; {6633#true} is VALID [2018-11-23 12:10:01,944 INFO L256 TraceCheckUtils]: 4: Hoare triple {6633#true} call #t~ret4 := main(); {6633#true} is VALID [2018-11-23 12:10:01,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {6633#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {6633#true} is VALID [2018-11-23 12:10:01,944 INFO L273 TraceCheckUtils]: 6: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,945 INFO L273 TraceCheckUtils]: 10: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,945 INFO L273 TraceCheckUtils]: 13: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,946 INFO L273 TraceCheckUtils]: 15: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,946 INFO L273 TraceCheckUtils]: 16: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,946 INFO L273 TraceCheckUtils]: 18: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,947 INFO L273 TraceCheckUtils]: 20: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,947 INFO L273 TraceCheckUtils]: 22: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,947 INFO L273 TraceCheckUtils]: 23: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,947 INFO L273 TraceCheckUtils]: 24: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,947 INFO L273 TraceCheckUtils]: 25: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,947 INFO L273 TraceCheckUtils]: 26: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,947 INFO L273 TraceCheckUtils]: 27: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,948 INFO L273 TraceCheckUtils]: 28: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,948 INFO L273 TraceCheckUtils]: 29: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,948 INFO L273 TraceCheckUtils]: 30: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,948 INFO L273 TraceCheckUtils]: 33: Hoare triple {6633#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6633#true} is VALID [2018-11-23 12:10:01,948 INFO L273 TraceCheckUtils]: 34: Hoare triple {6633#true} assume !(~i~0 < 100000); {6633#true} is VALID [2018-11-23 12:10:01,949 INFO L273 TraceCheckUtils]: 35: Hoare triple {6633#true} ~i~0 := 1; {6636#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:01,949 INFO L273 TraceCheckUtils]: 36: Hoare triple {6636#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6644#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:01,950 INFO L273 TraceCheckUtils]: 37: Hoare triple {6644#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6652#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:01,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {6652#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6660#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:01,951 INFO L273 TraceCheckUtils]: 39: Hoare triple {6660#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6784#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:01,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {6784#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6788#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:01,953 INFO L273 TraceCheckUtils]: 41: Hoare triple {6788#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {6792#(<= main_~i~0 49)} is VALID [2018-11-23 12:10:01,953 INFO L273 TraceCheckUtils]: 42: Hoare triple {6792#(<= main_~i~0 49)} assume !(~i~0 < 100000); {6634#false} is VALID [2018-11-23 12:10:01,953 INFO L273 TraceCheckUtils]: 43: Hoare triple {6634#false} ~i~0 := 1;~j~0 := 0; {6634#false} is VALID [2018-11-23 12:10:01,954 INFO L273 TraceCheckUtils]: 44: Hoare triple {6634#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {6634#false} is VALID [2018-11-23 12:10:01,954 INFO L256 TraceCheckUtils]: 45: Hoare triple {6634#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6634#false} is VALID [2018-11-23 12:10:01,954 INFO L273 TraceCheckUtils]: 46: Hoare triple {6634#false} ~cond := #in~cond; {6634#false} is VALID [2018-11-23 12:10:01,954 INFO L273 TraceCheckUtils]: 47: Hoare triple {6634#false} assume 0 == ~cond; {6634#false} is VALID [2018-11-23 12:10:01,954 INFO L273 TraceCheckUtils]: 48: Hoare triple {6634#false} assume !false; {6634#false} is VALID [2018-11-23 12:10:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-11-23 12:10:01,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:01,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 9] total 34 [2018-11-23 12:10:01,978 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 49 [2018-11-23 12:10:01,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:01,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:10:02,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:02,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:10:02,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:10:02,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:10:02,025 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 34 states. [2018-11-23 12:10:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:02,783 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2018-11-23 12:10:02,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:10:02,784 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 49 [2018-11-23 12:10:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:10:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 106 transitions. [2018-11-23 12:10:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:10:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 106 transitions. [2018-11-23 12:10:02,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 106 transitions. [2018-11-23 12:10:02,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:02,891 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:10:02,891 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 12:10:02,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:10:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 12:10:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 58. [2018-11-23 12:10:02,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:02,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 58 states. [2018-11-23 12:10:02,933 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 58 states. [2018-11-23 12:10:02,933 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 58 states. [2018-11-23 12:10:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:02,935 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-11-23 12:10:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-11-23 12:10:02,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:02,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:02,936 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 79 states. [2018-11-23 12:10:02,937 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 79 states. [2018-11-23 12:10:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:02,938 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-11-23 12:10:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-11-23 12:10:02,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:02,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:02,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:02,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:10:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-23 12:10:02,941 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 49 [2018-11-23 12:10:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:02,941 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-23 12:10:02,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:10:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 12:10:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:10:02,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:02,942 INFO L402 BasicCegarLoop]: trace histogram [32, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:02,942 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:02,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:02,942 INFO L82 PathProgramCache]: Analyzing trace with hash 882169417, now seen corresponding path program 19 times [2018-11-23 12:10:02,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:02,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:02,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:02,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:02,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:04,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {7246#true} call ULTIMATE.init(); {7246#true} is VALID [2018-11-23 12:10:04,009 INFO L273 TraceCheckUtils]: 1: Hoare triple {7246#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7246#true} is VALID [2018-11-23 12:10:04,009 INFO L273 TraceCheckUtils]: 2: Hoare triple {7246#true} assume true; {7246#true} is VALID [2018-11-23 12:10:04,009 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7246#true} {7246#true} #60#return; {7246#true} is VALID [2018-11-23 12:10:04,009 INFO L256 TraceCheckUtils]: 4: Hoare triple {7246#true} call #t~ret4 := main(); {7246#true} is VALID [2018-11-23 12:10:04,010 INFO L273 TraceCheckUtils]: 5: Hoare triple {7246#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7248#(= main_~i~0 0)} is VALID [2018-11-23 12:10:04,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {7248#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7249#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:04,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {7249#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7250#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:04,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {7250#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7251#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:04,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {7251#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7252#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:04,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {7252#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7253#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:04,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {7253#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7254#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:04,016 INFO L273 TraceCheckUtils]: 12: Hoare triple {7254#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7255#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:04,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {7255#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7256#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:04,018 INFO L273 TraceCheckUtils]: 14: Hoare triple {7256#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7257#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:04,019 INFO L273 TraceCheckUtils]: 15: Hoare triple {7257#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7258#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:04,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {7258#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7259#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:04,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {7259#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7260#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:04,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {7260#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7261#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:04,023 INFO L273 TraceCheckUtils]: 19: Hoare triple {7261#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7262#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:04,024 INFO L273 TraceCheckUtils]: 20: Hoare triple {7262#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7263#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:04,025 INFO L273 TraceCheckUtils]: 21: Hoare triple {7263#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7264#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:04,026 INFO L273 TraceCheckUtils]: 22: Hoare triple {7264#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7265#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:04,027 INFO L273 TraceCheckUtils]: 23: Hoare triple {7265#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7266#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:04,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {7266#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7267#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:04,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {7267#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7268#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:04,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {7268#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7269#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:04,031 INFO L273 TraceCheckUtils]: 27: Hoare triple {7269#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7270#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:04,032 INFO L273 TraceCheckUtils]: 28: Hoare triple {7270#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7271#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:04,033 INFO L273 TraceCheckUtils]: 29: Hoare triple {7271#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7272#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:04,034 INFO L273 TraceCheckUtils]: 30: Hoare triple {7272#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7273#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:04,035 INFO L273 TraceCheckUtils]: 31: Hoare triple {7273#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7274#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:04,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {7274#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7275#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:04,037 INFO L273 TraceCheckUtils]: 33: Hoare triple {7275#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7276#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:04,038 INFO L273 TraceCheckUtils]: 34: Hoare triple {7276#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7277#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:04,039 INFO L273 TraceCheckUtils]: 35: Hoare triple {7277#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7278#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:04,040 INFO L273 TraceCheckUtils]: 36: Hoare triple {7278#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7279#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:04,041 INFO L273 TraceCheckUtils]: 37: Hoare triple {7279#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7280#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:04,041 INFO L273 TraceCheckUtils]: 38: Hoare triple {7280#(<= main_~i~0 32)} assume !(~i~0 < 100000); {7247#false} is VALID [2018-11-23 12:10:04,041 INFO L273 TraceCheckUtils]: 39: Hoare triple {7247#false} ~i~0 := 1; {7247#false} is VALID [2018-11-23 12:10:04,042 INFO L273 TraceCheckUtils]: 40: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,042 INFO L273 TraceCheckUtils]: 42: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,043 INFO L273 TraceCheckUtils]: 47: Hoare triple {7247#false} assume !(~i~0 < 100000); {7247#false} is VALID [2018-11-23 12:10:04,043 INFO L273 TraceCheckUtils]: 48: Hoare triple {7247#false} ~i~0 := 1;~j~0 := 0; {7247#false} is VALID [2018-11-23 12:10:04,044 INFO L273 TraceCheckUtils]: 49: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {7247#false} is VALID [2018-11-23 12:10:04,044 INFO L256 TraceCheckUtils]: 50: Hoare triple {7247#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7247#false} is VALID [2018-11-23 12:10:04,044 INFO L273 TraceCheckUtils]: 51: Hoare triple {7247#false} ~cond := #in~cond; {7247#false} is VALID [2018-11-23 12:10:04,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {7247#false} assume 0 == ~cond; {7247#false} is VALID [2018-11-23 12:10:04,044 INFO L273 TraceCheckUtils]: 53: Hoare triple {7247#false} assume !false; {7247#false} is VALID [2018-11-23 12:10:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:10:04,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:04,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:04,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:10:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:04,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:04,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {7246#true} call ULTIMATE.init(); {7246#true} is VALID [2018-11-23 12:10:04,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {7246#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7246#true} is VALID [2018-11-23 12:10:04,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {7246#true} assume true; {7246#true} is VALID [2018-11-23 12:10:04,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7246#true} {7246#true} #60#return; {7246#true} is VALID [2018-11-23 12:10:04,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {7246#true} call #t~ret4 := main(); {7246#true} is VALID [2018-11-23 12:10:04,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {7246#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7299#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:04,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {7299#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7249#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:04,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {7249#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7250#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:04,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {7250#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7251#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:04,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {7251#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7252#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:04,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {7252#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7253#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:04,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {7253#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7254#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:04,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {7254#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7255#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:04,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {7255#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7256#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:04,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {7256#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7257#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:04,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {7257#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7258#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:04,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {7258#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7259#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:04,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {7259#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7260#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:04,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {7260#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7261#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:04,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {7261#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7262#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:04,339 INFO L273 TraceCheckUtils]: 20: Hoare triple {7262#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7263#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:04,340 INFO L273 TraceCheckUtils]: 21: Hoare triple {7263#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7264#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:04,341 INFO L273 TraceCheckUtils]: 22: Hoare triple {7264#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7265#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:04,342 INFO L273 TraceCheckUtils]: 23: Hoare triple {7265#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7266#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:04,343 INFO L273 TraceCheckUtils]: 24: Hoare triple {7266#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7267#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:04,344 INFO L273 TraceCheckUtils]: 25: Hoare triple {7267#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7268#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:04,345 INFO L273 TraceCheckUtils]: 26: Hoare triple {7268#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7269#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:04,346 INFO L273 TraceCheckUtils]: 27: Hoare triple {7269#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7270#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:04,347 INFO L273 TraceCheckUtils]: 28: Hoare triple {7270#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7271#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:04,348 INFO L273 TraceCheckUtils]: 29: Hoare triple {7271#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7272#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:04,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {7272#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7273#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:04,350 INFO L273 TraceCheckUtils]: 31: Hoare triple {7273#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7274#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:04,351 INFO L273 TraceCheckUtils]: 32: Hoare triple {7274#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7275#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:04,352 INFO L273 TraceCheckUtils]: 33: Hoare triple {7275#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7276#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:04,353 INFO L273 TraceCheckUtils]: 34: Hoare triple {7276#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7277#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:04,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {7277#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7278#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:04,355 INFO L273 TraceCheckUtils]: 36: Hoare triple {7278#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7279#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:04,356 INFO L273 TraceCheckUtils]: 37: Hoare triple {7279#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7280#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:04,357 INFO L273 TraceCheckUtils]: 38: Hoare triple {7280#(<= main_~i~0 32)} assume !(~i~0 < 100000); {7247#false} is VALID [2018-11-23 12:10:04,357 INFO L273 TraceCheckUtils]: 39: Hoare triple {7247#false} ~i~0 := 1; {7247#false} is VALID [2018-11-23 12:10:04,357 INFO L273 TraceCheckUtils]: 40: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,357 INFO L273 TraceCheckUtils]: 41: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,358 INFO L273 TraceCheckUtils]: 42: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,358 INFO L273 TraceCheckUtils]: 43: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,358 INFO L273 TraceCheckUtils]: 44: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,358 INFO L273 TraceCheckUtils]: 45: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,358 INFO L273 TraceCheckUtils]: 46: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7247#false} is VALID [2018-11-23 12:10:04,359 INFO L273 TraceCheckUtils]: 47: Hoare triple {7247#false} assume !(~i~0 < 100000); {7247#false} is VALID [2018-11-23 12:10:04,359 INFO L273 TraceCheckUtils]: 48: Hoare triple {7247#false} ~i~0 := 1;~j~0 := 0; {7247#false} is VALID [2018-11-23 12:10:04,359 INFO L273 TraceCheckUtils]: 49: Hoare triple {7247#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {7247#false} is VALID [2018-11-23 12:10:04,359 INFO L256 TraceCheckUtils]: 50: Hoare triple {7247#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7247#false} is VALID [2018-11-23 12:10:04,359 INFO L273 TraceCheckUtils]: 51: Hoare triple {7247#false} ~cond := #in~cond; {7247#false} is VALID [2018-11-23 12:10:04,360 INFO L273 TraceCheckUtils]: 52: Hoare triple {7247#false} assume 0 == ~cond; {7247#false} is VALID [2018-11-23 12:10:04,360 INFO L273 TraceCheckUtils]: 53: Hoare triple {7247#false} assume !false; {7247#false} is VALID [2018-11-23 12:10:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:10:04,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:04,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:10:04,382 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2018-11-23 12:10:04,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:04,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:10:04,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:04,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:10:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:10:04,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:10:04,421 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 36 states. [2018-11-23 12:10:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:05,337 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-23 12:10:05,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:10:05,337 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2018-11-23 12:10:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:10:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 88 transitions. [2018-11-23 12:10:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:10:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 88 transitions. [2018-11-23 12:10:05,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 88 transitions. [2018-11-23 12:10:05,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:05,544 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:10:05,544 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 12:10:05,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:10:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 12:10:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2018-11-23 12:10:05,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:05,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 59 states. [2018-11-23 12:10:05,579 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 59 states. [2018-11-23 12:10:05,580 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 59 states. [2018-11-23 12:10:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:05,581 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-11-23 12:10:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-11-23 12:10:05,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:05,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:05,581 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 71 states. [2018-11-23 12:10:05,582 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 71 states. [2018-11-23 12:10:05,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:05,583 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-11-23 12:10:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-11-23 12:10:05,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:05,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:05,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:05,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:10:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-23 12:10:05,585 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 54 [2018-11-23 12:10:05,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:05,585 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-23 12:10:05,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:10:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-23 12:10:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:10:05,586 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:05,586 INFO L402 BasicCegarLoop]: trace histogram [33, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:05,586 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:05,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:05,587 INFO L82 PathProgramCache]: Analyzing trace with hash 251380133, now seen corresponding path program 20 times [2018-11-23 12:10:05,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:05,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:05,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:05,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:10:05,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:06,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {7851#true} call ULTIMATE.init(); {7851#true} is VALID [2018-11-23 12:10:06,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {7851#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7851#true} is VALID [2018-11-23 12:10:06,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {7851#true} assume true; {7851#true} is VALID [2018-11-23 12:10:06,318 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7851#true} {7851#true} #60#return; {7851#true} is VALID [2018-11-23 12:10:06,318 INFO L256 TraceCheckUtils]: 4: Hoare triple {7851#true} call #t~ret4 := main(); {7851#true} is VALID [2018-11-23 12:10:06,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {7851#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7853#(= main_~i~0 0)} is VALID [2018-11-23 12:10:06,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {7853#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7854#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:06,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {7854#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7855#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:06,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {7855#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7856#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:06,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {7856#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7857#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:06,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {7857#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7858#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:06,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {7858#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7859#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:06,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {7859#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7860#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:06,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {7860#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7861#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:06,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {7861#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7862#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:06,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {7862#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7863#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:06,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {7863#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7864#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:06,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {7864#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7865#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:06,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {7865#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7866#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:06,332 INFO L273 TraceCheckUtils]: 19: Hoare triple {7866#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7867#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:06,333 INFO L273 TraceCheckUtils]: 20: Hoare triple {7867#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7868#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:06,334 INFO L273 TraceCheckUtils]: 21: Hoare triple {7868#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7869#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:06,335 INFO L273 TraceCheckUtils]: 22: Hoare triple {7869#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7870#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:06,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {7870#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7871#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:06,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {7871#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7872#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:06,356 INFO L273 TraceCheckUtils]: 25: Hoare triple {7872#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7873#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:06,357 INFO L273 TraceCheckUtils]: 26: Hoare triple {7873#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7874#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:06,357 INFO L273 TraceCheckUtils]: 27: Hoare triple {7874#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7875#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:06,358 INFO L273 TraceCheckUtils]: 28: Hoare triple {7875#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7876#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:06,359 INFO L273 TraceCheckUtils]: 29: Hoare triple {7876#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7877#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:06,359 INFO L273 TraceCheckUtils]: 30: Hoare triple {7877#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7878#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:06,360 INFO L273 TraceCheckUtils]: 31: Hoare triple {7878#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7879#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:06,360 INFO L273 TraceCheckUtils]: 32: Hoare triple {7879#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7880#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:06,361 INFO L273 TraceCheckUtils]: 33: Hoare triple {7880#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7881#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:06,381 INFO L273 TraceCheckUtils]: 34: Hoare triple {7881#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7882#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:06,383 INFO L273 TraceCheckUtils]: 35: Hoare triple {7882#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7883#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:06,392 INFO L273 TraceCheckUtils]: 36: Hoare triple {7883#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7884#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:06,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {7884#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7885#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:06,423 INFO L273 TraceCheckUtils]: 38: Hoare triple {7885#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7886#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:06,432 INFO L273 TraceCheckUtils]: 39: Hoare triple {7886#(<= main_~i~0 33)} assume !(~i~0 < 100000); {7852#false} is VALID [2018-11-23 12:10:06,432 INFO L273 TraceCheckUtils]: 40: Hoare triple {7852#false} ~i~0 := 1; {7852#false} is VALID [2018-11-23 12:10:06,432 INFO L273 TraceCheckUtils]: 41: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:06,432 INFO L273 TraceCheckUtils]: 42: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:06,433 INFO L273 TraceCheckUtils]: 43: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:06,433 INFO L273 TraceCheckUtils]: 44: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:06,433 INFO L273 TraceCheckUtils]: 45: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:06,433 INFO L273 TraceCheckUtils]: 46: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:06,434 INFO L273 TraceCheckUtils]: 47: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:06,434 INFO L273 TraceCheckUtils]: 48: Hoare triple {7852#false} assume !(~i~0 < 100000); {7852#false} is VALID [2018-11-23 12:10:06,434 INFO L273 TraceCheckUtils]: 49: Hoare triple {7852#false} ~i~0 := 1;~j~0 := 0; {7852#false} is VALID [2018-11-23 12:10:06,434 INFO L273 TraceCheckUtils]: 50: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {7852#false} is VALID [2018-11-23 12:10:06,434 INFO L256 TraceCheckUtils]: 51: Hoare triple {7852#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7852#false} is VALID [2018-11-23 12:10:06,435 INFO L273 TraceCheckUtils]: 52: Hoare triple {7852#false} ~cond := #in~cond; {7852#false} is VALID [2018-11-23 12:10:06,435 INFO L273 TraceCheckUtils]: 53: Hoare triple {7852#false} assume 0 == ~cond; {7852#false} is VALID [2018-11-23 12:10:06,435 INFO L273 TraceCheckUtils]: 54: Hoare triple {7852#false} assume !false; {7852#false} is VALID [2018-11-23 12:10:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:10:06,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:06,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:06,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:10:06,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:10:06,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:06,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:07,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {7851#true} call ULTIMATE.init(); {7851#true} is VALID [2018-11-23 12:10:07,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {7851#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7851#true} is VALID [2018-11-23 12:10:07,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {7851#true} assume true; {7851#true} is VALID [2018-11-23 12:10:07,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7851#true} {7851#true} #60#return; {7851#true} is VALID [2018-11-23 12:10:07,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {7851#true} call #t~ret4 := main(); {7851#true} is VALID [2018-11-23 12:10:07,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {7851#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7905#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:07,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {7905#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7854#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:07,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {7854#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7855#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:07,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {7855#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7856#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:07,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {7856#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7857#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:07,111 INFO L273 TraceCheckUtils]: 10: Hoare triple {7857#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7858#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:07,112 INFO L273 TraceCheckUtils]: 11: Hoare triple {7858#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7859#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:07,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {7859#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7860#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:07,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {7860#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7861#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:07,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {7861#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7862#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:07,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {7862#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7863#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:07,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {7863#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7864#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:07,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {7864#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7865#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:07,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {7865#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7866#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:07,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {7866#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7867#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:07,122 INFO L273 TraceCheckUtils]: 20: Hoare triple {7867#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7868#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:07,123 INFO L273 TraceCheckUtils]: 21: Hoare triple {7868#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7869#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:07,124 INFO L273 TraceCheckUtils]: 22: Hoare triple {7869#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7870#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:07,125 INFO L273 TraceCheckUtils]: 23: Hoare triple {7870#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7871#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:07,127 INFO L273 TraceCheckUtils]: 24: Hoare triple {7871#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7872#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:07,128 INFO L273 TraceCheckUtils]: 25: Hoare triple {7872#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7873#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:07,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {7873#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7874#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:07,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {7874#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7875#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:07,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {7875#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7876#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:07,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {7876#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7877#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:07,134 INFO L273 TraceCheckUtils]: 30: Hoare triple {7877#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7878#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:07,135 INFO L273 TraceCheckUtils]: 31: Hoare triple {7878#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7879#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:07,136 INFO L273 TraceCheckUtils]: 32: Hoare triple {7879#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7880#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:07,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {7880#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7881#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:07,138 INFO L273 TraceCheckUtils]: 34: Hoare triple {7881#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7882#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:07,139 INFO L273 TraceCheckUtils]: 35: Hoare triple {7882#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7883#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:07,141 INFO L273 TraceCheckUtils]: 36: Hoare triple {7883#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7884#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:07,142 INFO L273 TraceCheckUtils]: 37: Hoare triple {7884#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7885#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:07,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {7885#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7886#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:07,144 INFO L273 TraceCheckUtils]: 39: Hoare triple {7886#(<= main_~i~0 33)} assume !(~i~0 < 100000); {7852#false} is VALID [2018-11-23 12:10:07,144 INFO L273 TraceCheckUtils]: 40: Hoare triple {7852#false} ~i~0 := 1; {7852#false} is VALID [2018-11-23 12:10:07,144 INFO L273 TraceCheckUtils]: 41: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:07,144 INFO L273 TraceCheckUtils]: 42: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:07,145 INFO L273 TraceCheckUtils]: 43: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:07,145 INFO L273 TraceCheckUtils]: 44: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:07,145 INFO L273 TraceCheckUtils]: 45: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:07,145 INFO L273 TraceCheckUtils]: 46: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:07,146 INFO L273 TraceCheckUtils]: 47: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {7852#false} is VALID [2018-11-23 12:10:07,146 INFO L273 TraceCheckUtils]: 48: Hoare triple {7852#false} assume !(~i~0 < 100000); {7852#false} is VALID [2018-11-23 12:10:07,146 INFO L273 TraceCheckUtils]: 49: Hoare triple {7852#false} ~i~0 := 1;~j~0 := 0; {7852#false} is VALID [2018-11-23 12:10:07,146 INFO L273 TraceCheckUtils]: 50: Hoare triple {7852#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {7852#false} is VALID [2018-11-23 12:10:07,147 INFO L256 TraceCheckUtils]: 51: Hoare triple {7852#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7852#false} is VALID [2018-11-23 12:10:07,147 INFO L273 TraceCheckUtils]: 52: Hoare triple {7852#false} ~cond := #in~cond; {7852#false} is VALID [2018-11-23 12:10:07,147 INFO L273 TraceCheckUtils]: 53: Hoare triple {7852#false} assume 0 == ~cond; {7852#false} is VALID [2018-11-23 12:10:07,147 INFO L273 TraceCheckUtils]: 54: Hoare triple {7852#false} assume !false; {7852#false} is VALID [2018-11-23 12:10:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:10:07,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:07,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 12:10:07,170 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-11-23 12:10:07,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:07,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:10:07,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:07,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:10:07,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:10:07,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:10:07,210 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 37 states. [2018-11-23 12:10:08,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:08,107 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-23 12:10:08,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:10:08,107 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-11-23 12:10:08,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:10:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 94 transitions. [2018-11-23 12:10:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:10:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 94 transitions. [2018-11-23 12:10:08,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 94 transitions. [2018-11-23 12:10:08,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:08,227 INFO L225 Difference]: With dead ends: 94 [2018-11-23 12:10:08,228 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 12:10:08,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:10:08,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 12:10:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2018-11-23 12:10:08,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:08,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 60 states. [2018-11-23 12:10:08,270 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 60 states. [2018-11-23 12:10:08,270 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 60 states. [2018-11-23 12:10:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:08,272 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-23 12:10:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-11-23 12:10:08,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:08,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:08,273 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 75 states. [2018-11-23 12:10:08,273 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 75 states. [2018-11-23 12:10:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:08,275 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-23 12:10:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-11-23 12:10:08,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:08,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:08,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:08,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:10:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-23 12:10:08,277 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2018-11-23 12:10:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:08,277 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-23 12:10:08,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:10:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-23 12:10:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:10:08,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:08,278 INFO L402 BasicCegarLoop]: trace histogram [34, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:08,279 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:08,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:08,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2123218487, now seen corresponding path program 21 times [2018-11-23 12:10:08,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:08,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:08,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:08,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:08,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:09,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {8477#true} call ULTIMATE.init(); {8477#true} is VALID [2018-11-23 12:10:09,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {8477#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8477#true} is VALID [2018-11-23 12:10:09,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {8477#true} assume true; {8477#true} is VALID [2018-11-23 12:10:09,112 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8477#true} {8477#true} #60#return; {8477#true} is VALID [2018-11-23 12:10:09,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {8477#true} call #t~ret4 := main(); {8477#true} is VALID [2018-11-23 12:10:09,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {8477#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {8479#(= main_~i~0 0)} is VALID [2018-11-23 12:10:09,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {8479#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8480#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:09,115 INFO L273 TraceCheckUtils]: 7: Hoare triple {8480#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8481#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:09,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {8481#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8482#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:09,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {8482#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8483#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:09,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {8483#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8484#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:09,119 INFO L273 TraceCheckUtils]: 11: Hoare triple {8484#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8485#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:09,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {8485#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8486#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:09,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {8486#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8487#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:09,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {8487#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8488#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:09,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {8488#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8489#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:09,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {8489#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8490#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:09,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {8490#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8491#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:09,128 INFO L273 TraceCheckUtils]: 18: Hoare triple {8491#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8492#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:09,129 INFO L273 TraceCheckUtils]: 19: Hoare triple {8492#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8493#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:09,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {8493#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8494#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:09,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {8494#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8495#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:09,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {8495#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8496#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:09,131 INFO L273 TraceCheckUtils]: 23: Hoare triple {8496#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8497#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:09,132 INFO L273 TraceCheckUtils]: 24: Hoare triple {8497#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8498#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:09,133 INFO L273 TraceCheckUtils]: 25: Hoare triple {8498#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8499#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:09,134 INFO L273 TraceCheckUtils]: 26: Hoare triple {8499#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8500#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:09,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {8500#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8501#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:09,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {8501#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8502#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:09,137 INFO L273 TraceCheckUtils]: 29: Hoare triple {8502#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8503#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:09,138 INFO L273 TraceCheckUtils]: 30: Hoare triple {8503#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8504#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:09,139 INFO L273 TraceCheckUtils]: 31: Hoare triple {8504#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8505#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:09,140 INFO L273 TraceCheckUtils]: 32: Hoare triple {8505#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8506#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:09,141 INFO L273 TraceCheckUtils]: 33: Hoare triple {8506#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8507#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:09,142 INFO L273 TraceCheckUtils]: 34: Hoare triple {8507#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8508#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:09,143 INFO L273 TraceCheckUtils]: 35: Hoare triple {8508#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8509#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:09,144 INFO L273 TraceCheckUtils]: 36: Hoare triple {8509#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8510#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:09,145 INFO L273 TraceCheckUtils]: 37: Hoare triple {8510#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8511#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:09,146 INFO L273 TraceCheckUtils]: 38: Hoare triple {8511#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8512#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:09,147 INFO L273 TraceCheckUtils]: 39: Hoare triple {8512#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8513#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:09,148 INFO L273 TraceCheckUtils]: 40: Hoare triple {8513#(<= main_~i~0 34)} assume !(~i~0 < 100000); {8478#false} is VALID [2018-11-23 12:10:09,148 INFO L273 TraceCheckUtils]: 41: Hoare triple {8478#false} ~i~0 := 1; {8478#false} is VALID [2018-11-23 12:10:09,148 INFO L273 TraceCheckUtils]: 42: Hoare triple {8478#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8478#false} is VALID [2018-11-23 12:10:09,148 INFO L273 TraceCheckUtils]: 43: Hoare triple {8478#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8478#false} is VALID [2018-11-23 12:10:09,148 INFO L273 TraceCheckUtils]: 44: Hoare triple {8478#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8478#false} is VALID [2018-11-23 12:10:09,149 INFO L273 TraceCheckUtils]: 45: Hoare triple {8478#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8478#false} is VALID [2018-11-23 12:10:09,149 INFO L273 TraceCheckUtils]: 46: Hoare triple {8478#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8478#false} is VALID [2018-11-23 12:10:09,149 INFO L273 TraceCheckUtils]: 47: Hoare triple {8478#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8478#false} is VALID [2018-11-23 12:10:09,149 INFO L273 TraceCheckUtils]: 48: Hoare triple {8478#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8478#false} is VALID [2018-11-23 12:10:09,149 INFO L273 TraceCheckUtils]: 49: Hoare triple {8478#false} assume !(~i~0 < 100000); {8478#false} is VALID [2018-11-23 12:10:09,150 INFO L273 TraceCheckUtils]: 50: Hoare triple {8478#false} ~i~0 := 1;~j~0 := 0; {8478#false} is VALID [2018-11-23 12:10:09,150 INFO L273 TraceCheckUtils]: 51: Hoare triple {8478#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {8478#false} is VALID [2018-11-23 12:10:09,150 INFO L256 TraceCheckUtils]: 52: Hoare triple {8478#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8478#false} is VALID [2018-11-23 12:10:09,150 INFO L273 TraceCheckUtils]: 53: Hoare triple {8478#false} ~cond := #in~cond; {8478#false} is VALID [2018-11-23 12:10:09,150 INFO L273 TraceCheckUtils]: 54: Hoare triple {8478#false} assume 0 == ~cond; {8478#false} is VALID [2018-11-23 12:10:09,151 INFO L273 TraceCheckUtils]: 55: Hoare triple {8478#false} assume !false; {8478#false} is VALID [2018-11-23 12:10:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:10:09,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:09,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:09,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:10:09,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 12:10:09,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:09,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:09,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {8477#true} call ULTIMATE.init(); {8477#true} is VALID [2018-11-23 12:10:09,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {8477#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8477#true} is VALID [2018-11-23 12:10:09,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {8477#true} assume true; {8477#true} is VALID [2018-11-23 12:10:09,498 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8477#true} {8477#true} #60#return; {8477#true} is VALID [2018-11-23 12:10:09,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {8477#true} call #t~ret4 := main(); {8477#true} is VALID [2018-11-23 12:10:09,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {8477#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {8477#true} is VALID [2018-11-23 12:10:09,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,500 INFO L273 TraceCheckUtils]: 17: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,500 INFO L273 TraceCheckUtils]: 18: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,501 INFO L273 TraceCheckUtils]: 23: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,501 INFO L273 TraceCheckUtils]: 25: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,501 INFO L273 TraceCheckUtils]: 26: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,501 INFO L273 TraceCheckUtils]: 27: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,501 INFO L273 TraceCheckUtils]: 28: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,502 INFO L273 TraceCheckUtils]: 29: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,502 INFO L273 TraceCheckUtils]: 30: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,502 INFO L273 TraceCheckUtils]: 31: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,502 INFO L273 TraceCheckUtils]: 32: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,502 INFO L273 TraceCheckUtils]: 33: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,502 INFO L273 TraceCheckUtils]: 34: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,502 INFO L273 TraceCheckUtils]: 35: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,502 INFO L273 TraceCheckUtils]: 36: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,502 INFO L273 TraceCheckUtils]: 37: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,503 INFO L273 TraceCheckUtils]: 38: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,503 INFO L273 TraceCheckUtils]: 39: Hoare triple {8477#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8477#true} is VALID [2018-11-23 12:10:09,503 INFO L273 TraceCheckUtils]: 40: Hoare triple {8477#true} assume !(~i~0 < 100000); {8477#true} is VALID [2018-11-23 12:10:09,521 INFO L273 TraceCheckUtils]: 41: Hoare triple {8477#true} ~i~0 := 1; {8480#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:09,526 INFO L273 TraceCheckUtils]: 42: Hoare triple {8480#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8488#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:09,527 INFO L273 TraceCheckUtils]: 43: Hoare triple {8488#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8496#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:09,527 INFO L273 TraceCheckUtils]: 44: Hoare triple {8496#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8504#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:09,528 INFO L273 TraceCheckUtils]: 45: Hoare triple {8504#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8512#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:09,528 INFO L273 TraceCheckUtils]: 46: Hoare triple {8512#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8655#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:09,529 INFO L273 TraceCheckUtils]: 47: Hoare triple {8655#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8659#(<= main_~i~0 49)} is VALID [2018-11-23 12:10:09,530 INFO L273 TraceCheckUtils]: 48: Hoare triple {8659#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {8663#(<= main_~i~0 57)} is VALID [2018-11-23 12:10:09,530 INFO L273 TraceCheckUtils]: 49: Hoare triple {8663#(<= main_~i~0 57)} assume !(~i~0 < 100000); {8478#false} is VALID [2018-11-23 12:10:09,530 INFO L273 TraceCheckUtils]: 50: Hoare triple {8478#false} ~i~0 := 1;~j~0 := 0; {8478#false} is VALID [2018-11-23 12:10:09,530 INFO L273 TraceCheckUtils]: 51: Hoare triple {8478#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {8478#false} is VALID [2018-11-23 12:10:09,530 INFO L256 TraceCheckUtils]: 52: Hoare triple {8478#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8478#false} is VALID [2018-11-23 12:10:09,531 INFO L273 TraceCheckUtils]: 53: Hoare triple {8478#false} ~cond := #in~cond; {8478#false} is VALID [2018-11-23 12:10:09,531 INFO L273 TraceCheckUtils]: 54: Hoare triple {8478#false} assume 0 == ~cond; {8478#false} is VALID [2018-11-23 12:10:09,531 INFO L273 TraceCheckUtils]: 55: Hoare triple {8478#false} assume !false; {8478#false} is VALID [2018-11-23 12:10:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-11-23 12:10:09,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:09,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 10] total 40 [2018-11-23 12:10:09,554 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 56 [2018-11-23 12:10:09,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:09,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:10:09,606 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:10:09,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:10:09,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:10:09,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:10:09,608 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 40 states. [2018-11-23 12:10:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:10,539 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-11-23 12:10:10,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:10:10,539 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 56 [2018-11-23 12:10:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:10:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 117 transitions. [2018-11-23 12:10:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:10:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 117 transitions. [2018-11-23 12:10:10,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 117 transitions. [2018-11-23 12:10:11,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:11,427 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:10:11,427 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:10:11,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:10:11,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:10:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2018-11-23 12:10:11,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:11,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 65 states. [2018-11-23 12:10:11,482 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 65 states. [2018-11-23 12:10:11,482 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 65 states. [2018-11-23 12:10:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:11,484 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-23 12:10:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-23 12:10:11,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:11,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:11,485 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 89 states. [2018-11-23 12:10:11,485 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 89 states. [2018-11-23 12:10:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:11,487 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-23 12:10:11,487 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-23 12:10:11,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:11,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:11,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:11,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:11,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:10:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-11-23 12:10:11,489 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 56 [2018-11-23 12:10:11,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:11,489 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-11-23 12:10:11,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:10:11,489 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-23 12:10:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:10:11,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:11,490 INFO L402 BasicCegarLoop]: trace histogram [38, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:11,491 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:11,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:11,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1347116378, now seen corresponding path program 22 times [2018-11-23 12:10:11,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:11,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:11,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:11,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:11,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:12,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {9172#true} call ULTIMATE.init(); {9172#true} is VALID [2018-11-23 12:10:12,771 INFO L273 TraceCheckUtils]: 1: Hoare triple {9172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9172#true} is VALID [2018-11-23 12:10:12,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {9172#true} assume true; {9172#true} is VALID [2018-11-23 12:10:12,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9172#true} {9172#true} #60#return; {9172#true} is VALID [2018-11-23 12:10:12,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {9172#true} call #t~ret4 := main(); {9172#true} is VALID [2018-11-23 12:10:12,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {9172#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {9174#(= main_~i~0 0)} is VALID [2018-11-23 12:10:12,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {9174#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9175#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:12,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {9175#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9176#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:12,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {9176#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9177#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:12,775 INFO L273 TraceCheckUtils]: 9: Hoare triple {9177#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9178#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:12,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {9178#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9179#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:12,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {9179#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9180#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:12,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {9180#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9181#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:12,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {9181#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9182#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:12,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {9182#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9183#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:12,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {9183#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9184#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:12,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {9184#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9185#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:12,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {9185#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9186#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:12,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {9186#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9187#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:12,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {9187#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9188#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:12,785 INFO L273 TraceCheckUtils]: 20: Hoare triple {9188#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9189#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:12,786 INFO L273 TraceCheckUtils]: 21: Hoare triple {9189#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9190#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:12,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {9190#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9191#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:12,788 INFO L273 TraceCheckUtils]: 23: Hoare triple {9191#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9192#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:12,789 INFO L273 TraceCheckUtils]: 24: Hoare triple {9192#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9193#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:12,790 INFO L273 TraceCheckUtils]: 25: Hoare triple {9193#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9194#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:12,791 INFO L273 TraceCheckUtils]: 26: Hoare triple {9194#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9195#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:12,792 INFO L273 TraceCheckUtils]: 27: Hoare triple {9195#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9196#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:12,793 INFO L273 TraceCheckUtils]: 28: Hoare triple {9196#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9197#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:12,794 INFO L273 TraceCheckUtils]: 29: Hoare triple {9197#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9198#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:12,795 INFO L273 TraceCheckUtils]: 30: Hoare triple {9198#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9199#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:12,796 INFO L273 TraceCheckUtils]: 31: Hoare triple {9199#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9200#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:12,797 INFO L273 TraceCheckUtils]: 32: Hoare triple {9200#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9201#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:12,798 INFO L273 TraceCheckUtils]: 33: Hoare triple {9201#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9202#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:12,799 INFO L273 TraceCheckUtils]: 34: Hoare triple {9202#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9203#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:12,800 INFO L273 TraceCheckUtils]: 35: Hoare triple {9203#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9204#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:12,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {9204#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9205#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:12,802 INFO L273 TraceCheckUtils]: 37: Hoare triple {9205#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9206#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:12,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {9206#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9207#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:12,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {9207#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9208#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:12,805 INFO L273 TraceCheckUtils]: 40: Hoare triple {9208#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9209#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:12,806 INFO L273 TraceCheckUtils]: 41: Hoare triple {9209#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9210#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:12,807 INFO L273 TraceCheckUtils]: 42: Hoare triple {9210#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9211#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:12,808 INFO L273 TraceCheckUtils]: 43: Hoare triple {9211#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9212#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:12,809 INFO L273 TraceCheckUtils]: 44: Hoare triple {9212#(<= main_~i~0 38)} assume !(~i~0 < 100000); {9173#false} is VALID [2018-11-23 12:10:12,809 INFO L273 TraceCheckUtils]: 45: Hoare triple {9173#false} ~i~0 := 1; {9173#false} is VALID [2018-11-23 12:10:12,809 INFO L273 TraceCheckUtils]: 46: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:12,810 INFO L273 TraceCheckUtils]: 47: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:12,810 INFO L273 TraceCheckUtils]: 48: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:12,810 INFO L273 TraceCheckUtils]: 49: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:12,810 INFO L273 TraceCheckUtils]: 50: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:12,810 INFO L273 TraceCheckUtils]: 51: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:12,811 INFO L273 TraceCheckUtils]: 52: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:12,811 INFO L273 TraceCheckUtils]: 53: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:12,811 INFO L273 TraceCheckUtils]: 54: Hoare triple {9173#false} assume !(~i~0 < 100000); {9173#false} is VALID [2018-11-23 12:10:12,811 INFO L273 TraceCheckUtils]: 55: Hoare triple {9173#false} ~i~0 := 1;~j~0 := 0; {9173#false} is VALID [2018-11-23 12:10:12,811 INFO L273 TraceCheckUtils]: 56: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {9173#false} is VALID [2018-11-23 12:10:12,812 INFO L256 TraceCheckUtils]: 57: Hoare triple {9173#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9173#false} is VALID [2018-11-23 12:10:12,812 INFO L273 TraceCheckUtils]: 58: Hoare triple {9173#false} ~cond := #in~cond; {9173#false} is VALID [2018-11-23 12:10:12,812 INFO L273 TraceCheckUtils]: 59: Hoare triple {9173#false} assume 0 == ~cond; {9173#false} is VALID [2018-11-23 12:10:12,812 INFO L273 TraceCheckUtils]: 60: Hoare triple {9173#false} assume !false; {9173#false} is VALID [2018-11-23 12:10:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:10:12,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:12,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:12,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:10:12,891 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:10:12,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:12,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:13,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {9172#true} call ULTIMATE.init(); {9172#true} is VALID [2018-11-23 12:10:13,171 INFO L273 TraceCheckUtils]: 1: Hoare triple {9172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9172#true} is VALID [2018-11-23 12:10:13,171 INFO L273 TraceCheckUtils]: 2: Hoare triple {9172#true} assume true; {9172#true} is VALID [2018-11-23 12:10:13,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9172#true} {9172#true} #60#return; {9172#true} is VALID [2018-11-23 12:10:13,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {9172#true} call #t~ret4 := main(); {9172#true} is VALID [2018-11-23 12:10:13,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {9172#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {9231#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:13,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {9231#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9175#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:13,174 INFO L273 TraceCheckUtils]: 7: Hoare triple {9175#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9176#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:13,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {9176#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9177#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:13,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {9177#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9178#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:13,177 INFO L273 TraceCheckUtils]: 10: Hoare triple {9178#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9179#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:13,178 INFO L273 TraceCheckUtils]: 11: Hoare triple {9179#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9180#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:13,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {9180#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9181#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:13,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {9181#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9182#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:13,181 INFO L273 TraceCheckUtils]: 14: Hoare triple {9182#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9183#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:13,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {9183#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9184#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:13,183 INFO L273 TraceCheckUtils]: 16: Hoare triple {9184#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9185#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:13,184 INFO L273 TraceCheckUtils]: 17: Hoare triple {9185#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9186#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:13,185 INFO L273 TraceCheckUtils]: 18: Hoare triple {9186#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9187#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:13,186 INFO L273 TraceCheckUtils]: 19: Hoare triple {9187#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9188#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:13,187 INFO L273 TraceCheckUtils]: 20: Hoare triple {9188#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9189#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:13,188 INFO L273 TraceCheckUtils]: 21: Hoare triple {9189#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9190#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:13,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {9190#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9191#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:13,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {9191#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9192#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:13,191 INFO L273 TraceCheckUtils]: 24: Hoare triple {9192#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9193#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:13,192 INFO L273 TraceCheckUtils]: 25: Hoare triple {9193#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9194#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:13,193 INFO L273 TraceCheckUtils]: 26: Hoare triple {9194#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9195#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:13,194 INFO L273 TraceCheckUtils]: 27: Hoare triple {9195#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9196#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:13,195 INFO L273 TraceCheckUtils]: 28: Hoare triple {9196#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9197#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:13,196 INFO L273 TraceCheckUtils]: 29: Hoare triple {9197#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9198#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:13,197 INFO L273 TraceCheckUtils]: 30: Hoare triple {9198#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9199#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:13,198 INFO L273 TraceCheckUtils]: 31: Hoare triple {9199#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9200#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:13,199 INFO L273 TraceCheckUtils]: 32: Hoare triple {9200#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9201#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:13,200 INFO L273 TraceCheckUtils]: 33: Hoare triple {9201#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9202#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:13,201 INFO L273 TraceCheckUtils]: 34: Hoare triple {9202#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9203#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:13,202 INFO L273 TraceCheckUtils]: 35: Hoare triple {9203#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9204#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:13,203 INFO L273 TraceCheckUtils]: 36: Hoare triple {9204#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9205#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:13,204 INFO L273 TraceCheckUtils]: 37: Hoare triple {9205#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9206#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:13,205 INFO L273 TraceCheckUtils]: 38: Hoare triple {9206#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9207#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:13,206 INFO L273 TraceCheckUtils]: 39: Hoare triple {9207#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9208#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:13,207 INFO L273 TraceCheckUtils]: 40: Hoare triple {9208#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9209#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:13,208 INFO L273 TraceCheckUtils]: 41: Hoare triple {9209#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9210#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:13,209 INFO L273 TraceCheckUtils]: 42: Hoare triple {9210#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9211#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:13,210 INFO L273 TraceCheckUtils]: 43: Hoare triple {9211#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9212#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:13,211 INFO L273 TraceCheckUtils]: 44: Hoare triple {9212#(<= main_~i~0 38)} assume !(~i~0 < 100000); {9173#false} is VALID [2018-11-23 12:10:13,211 INFO L273 TraceCheckUtils]: 45: Hoare triple {9173#false} ~i~0 := 1; {9173#false} is VALID [2018-11-23 12:10:13,211 INFO L273 TraceCheckUtils]: 46: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:13,212 INFO L273 TraceCheckUtils]: 47: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:13,212 INFO L273 TraceCheckUtils]: 48: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:13,212 INFO L273 TraceCheckUtils]: 49: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:13,212 INFO L273 TraceCheckUtils]: 50: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:13,212 INFO L273 TraceCheckUtils]: 51: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:13,213 INFO L273 TraceCheckUtils]: 52: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:13,213 INFO L273 TraceCheckUtils]: 53: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9173#false} is VALID [2018-11-23 12:10:13,213 INFO L273 TraceCheckUtils]: 54: Hoare triple {9173#false} assume !(~i~0 < 100000); {9173#false} is VALID [2018-11-23 12:10:13,213 INFO L273 TraceCheckUtils]: 55: Hoare triple {9173#false} ~i~0 := 1;~j~0 := 0; {9173#false} is VALID [2018-11-23 12:10:13,214 INFO L273 TraceCheckUtils]: 56: Hoare triple {9173#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {9173#false} is VALID [2018-11-23 12:10:13,214 INFO L256 TraceCheckUtils]: 57: Hoare triple {9173#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9173#false} is VALID [2018-11-23 12:10:13,214 INFO L273 TraceCheckUtils]: 58: Hoare triple {9173#false} ~cond := #in~cond; {9173#false} is VALID [2018-11-23 12:10:13,214 INFO L273 TraceCheckUtils]: 59: Hoare triple {9173#false} assume 0 == ~cond; {9173#false} is VALID [2018-11-23 12:10:13,214 INFO L273 TraceCheckUtils]: 60: Hoare triple {9173#false} assume !false; {9173#false} is VALID [2018-11-23 12:10:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:10:13,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:13,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:10:13,240 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 61 [2018-11-23 12:10:13,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:13,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:10:13,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:13,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:10:13,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:10:13,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:10:13,284 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 42 states. [2018-11-23 12:10:14,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:14,828 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:10:14,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:10:14,828 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 61 [2018-11-23 12:10:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:10:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 99 transitions. [2018-11-23 12:10:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:10:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 99 transitions. [2018-11-23 12:10:14,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 99 transitions. [2018-11-23 12:10:14,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:14,942 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:10:14,942 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:10:14,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:10:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:10:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 66. [2018-11-23 12:10:14,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:14,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 66 states. [2018-11-23 12:10:14,995 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 66 states. [2018-11-23 12:10:14,995 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 66 states. [2018-11-23 12:10:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:14,997 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-11-23 12:10:14,997 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-11-23 12:10:14,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:14,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:14,997 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 81 states. [2018-11-23 12:10:14,997 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 81 states. [2018-11-23 12:10:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:14,999 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-11-23 12:10:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-11-23 12:10:14,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:14,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:14,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:14,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:10:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-23 12:10:15,000 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 61 [2018-11-23 12:10:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:15,000 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-23 12:10:15,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:10:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 12:10:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:10:15,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:15,001 INFO L402 BasicCegarLoop]: trace histogram [39, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:15,002 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:15,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2141943754, now seen corresponding path program 23 times [2018-11-23 12:10:15,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:15,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:15,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:15,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:15,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:15,903 INFO L256 TraceCheckUtils]: 0: Hoare triple {9859#true} call ULTIMATE.init(); {9859#true} is VALID [2018-11-23 12:10:15,904 INFO L273 TraceCheckUtils]: 1: Hoare triple {9859#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9859#true} is VALID [2018-11-23 12:10:15,904 INFO L273 TraceCheckUtils]: 2: Hoare triple {9859#true} assume true; {9859#true} is VALID [2018-11-23 12:10:15,904 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9859#true} {9859#true} #60#return; {9859#true} is VALID [2018-11-23 12:10:15,905 INFO L256 TraceCheckUtils]: 4: Hoare triple {9859#true} call #t~ret4 := main(); {9859#true} is VALID [2018-11-23 12:10:15,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {9859#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {9861#(= main_~i~0 0)} is VALID [2018-11-23 12:10:15,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {9861#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9862#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:15,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {9862#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9863#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:15,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {9863#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9864#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:15,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {9864#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9865#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:15,908 INFO L273 TraceCheckUtils]: 10: Hoare triple {9865#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9866#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:15,909 INFO L273 TraceCheckUtils]: 11: Hoare triple {9866#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9867#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:15,910 INFO L273 TraceCheckUtils]: 12: Hoare triple {9867#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9868#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:15,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {9868#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9869#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:15,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {9869#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9870#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:15,913 INFO L273 TraceCheckUtils]: 15: Hoare triple {9870#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9871#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:15,914 INFO L273 TraceCheckUtils]: 16: Hoare triple {9871#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9872#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:15,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {9872#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9873#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:15,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {9873#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9874#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:15,917 INFO L273 TraceCheckUtils]: 19: Hoare triple {9874#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9875#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:15,918 INFO L273 TraceCheckUtils]: 20: Hoare triple {9875#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9876#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:15,919 INFO L273 TraceCheckUtils]: 21: Hoare triple {9876#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9877#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:15,920 INFO L273 TraceCheckUtils]: 22: Hoare triple {9877#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9878#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:15,921 INFO L273 TraceCheckUtils]: 23: Hoare triple {9878#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9879#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:15,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {9879#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9880#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:15,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {9880#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9881#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:15,924 INFO L273 TraceCheckUtils]: 26: Hoare triple {9881#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9882#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:15,925 INFO L273 TraceCheckUtils]: 27: Hoare triple {9882#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9883#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:15,926 INFO L273 TraceCheckUtils]: 28: Hoare triple {9883#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9884#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:15,927 INFO L273 TraceCheckUtils]: 29: Hoare triple {9884#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9885#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:15,928 INFO L273 TraceCheckUtils]: 30: Hoare triple {9885#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9886#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:15,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {9886#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9887#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:15,930 INFO L273 TraceCheckUtils]: 32: Hoare triple {9887#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9888#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:15,931 INFO L273 TraceCheckUtils]: 33: Hoare triple {9888#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9889#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:15,932 INFO L273 TraceCheckUtils]: 34: Hoare triple {9889#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9890#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:15,933 INFO L273 TraceCheckUtils]: 35: Hoare triple {9890#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9891#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:15,934 INFO L273 TraceCheckUtils]: 36: Hoare triple {9891#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9892#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:15,935 INFO L273 TraceCheckUtils]: 37: Hoare triple {9892#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9893#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:15,936 INFO L273 TraceCheckUtils]: 38: Hoare triple {9893#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9894#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:15,938 INFO L273 TraceCheckUtils]: 39: Hoare triple {9894#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9895#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:15,939 INFO L273 TraceCheckUtils]: 40: Hoare triple {9895#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9896#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:15,940 INFO L273 TraceCheckUtils]: 41: Hoare triple {9896#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9897#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:15,941 INFO L273 TraceCheckUtils]: 42: Hoare triple {9897#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9898#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:15,942 INFO L273 TraceCheckUtils]: 43: Hoare triple {9898#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9899#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:15,943 INFO L273 TraceCheckUtils]: 44: Hoare triple {9899#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9900#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:15,943 INFO L273 TraceCheckUtils]: 45: Hoare triple {9900#(<= main_~i~0 39)} assume !(~i~0 < 100000); {9860#false} is VALID [2018-11-23 12:10:15,943 INFO L273 TraceCheckUtils]: 46: Hoare triple {9860#false} ~i~0 := 1; {9860#false} is VALID [2018-11-23 12:10:15,944 INFO L273 TraceCheckUtils]: 47: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:10:15,944 INFO L273 TraceCheckUtils]: 48: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:10:15,944 INFO L273 TraceCheckUtils]: 49: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:10:15,944 INFO L273 TraceCheckUtils]: 50: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:10:15,945 INFO L273 TraceCheckUtils]: 51: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:10:15,945 INFO L273 TraceCheckUtils]: 52: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:10:15,945 INFO L273 TraceCheckUtils]: 53: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:10:15,945 INFO L273 TraceCheckUtils]: 54: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:10:15,945 INFO L273 TraceCheckUtils]: 55: Hoare triple {9860#false} assume !(~i~0 < 100000); {9860#false} is VALID [2018-11-23 12:10:15,946 INFO L273 TraceCheckUtils]: 56: Hoare triple {9860#false} ~i~0 := 1;~j~0 := 0; {9860#false} is VALID [2018-11-23 12:10:15,946 INFO L273 TraceCheckUtils]: 57: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {9860#false} is VALID [2018-11-23 12:10:15,946 INFO L256 TraceCheckUtils]: 58: Hoare triple {9860#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9860#false} is VALID [2018-11-23 12:10:15,946 INFO L273 TraceCheckUtils]: 59: Hoare triple {9860#false} ~cond := #in~cond; {9860#false} is VALID [2018-11-23 12:10:15,946 INFO L273 TraceCheckUtils]: 60: Hoare triple {9860#false} assume 0 == ~cond; {9860#false} is VALID [2018-11-23 12:10:15,946 INFO L273 TraceCheckUtils]: 61: Hoare triple {9860#false} assume !false; {9860#false} is VALID [2018-11-23 12:10:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:10:15,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:15,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:15,958 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:11:05,611 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-11-23 12:11:05,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:05,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:05,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {9859#true} call ULTIMATE.init(); {9859#true} is VALID [2018-11-23 12:11:05,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {9859#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9859#true} is VALID [2018-11-23 12:11:05,877 INFO L273 TraceCheckUtils]: 2: Hoare triple {9859#true} assume true; {9859#true} is VALID [2018-11-23 12:11:05,877 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9859#true} {9859#true} #60#return; {9859#true} is VALID [2018-11-23 12:11:05,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {9859#true} call #t~ret4 := main(); {9859#true} is VALID [2018-11-23 12:11:05,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {9859#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {9919#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:05,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {9919#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9862#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:05,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {9862#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9863#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:05,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {9863#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9864#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:05,882 INFO L273 TraceCheckUtils]: 9: Hoare triple {9864#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9865#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:05,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {9865#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9866#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:05,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {9866#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9867#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:05,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {9867#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9868#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:05,885 INFO L273 TraceCheckUtils]: 13: Hoare triple {9868#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9869#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:05,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {9869#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9870#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:05,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {9870#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9871#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:05,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {9871#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9872#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:05,889 INFO L273 TraceCheckUtils]: 17: Hoare triple {9872#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9873#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:05,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {9873#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9874#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:05,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {9874#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9875#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:05,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {9875#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9876#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:05,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {9876#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9877#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:05,894 INFO L273 TraceCheckUtils]: 22: Hoare triple {9877#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9878#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:05,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {9878#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9879#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:05,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {9879#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9880#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:05,896 INFO L273 TraceCheckUtils]: 25: Hoare triple {9880#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9881#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:05,897 INFO L273 TraceCheckUtils]: 26: Hoare triple {9881#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9882#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:05,898 INFO L273 TraceCheckUtils]: 27: Hoare triple {9882#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9883#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:05,899 INFO L273 TraceCheckUtils]: 28: Hoare triple {9883#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9884#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:05,900 INFO L273 TraceCheckUtils]: 29: Hoare triple {9884#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9885#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:05,901 INFO L273 TraceCheckUtils]: 30: Hoare triple {9885#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9886#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:05,902 INFO L273 TraceCheckUtils]: 31: Hoare triple {9886#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9887#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:05,903 INFO L273 TraceCheckUtils]: 32: Hoare triple {9887#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9888#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:05,904 INFO L273 TraceCheckUtils]: 33: Hoare triple {9888#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9889#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:05,905 INFO L273 TraceCheckUtils]: 34: Hoare triple {9889#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9890#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:05,906 INFO L273 TraceCheckUtils]: 35: Hoare triple {9890#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9891#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:05,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {9891#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9892#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:05,908 INFO L273 TraceCheckUtils]: 37: Hoare triple {9892#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9893#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:05,909 INFO L273 TraceCheckUtils]: 38: Hoare triple {9893#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9894#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:05,910 INFO L273 TraceCheckUtils]: 39: Hoare triple {9894#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9895#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:05,911 INFO L273 TraceCheckUtils]: 40: Hoare triple {9895#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9896#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:05,912 INFO L273 TraceCheckUtils]: 41: Hoare triple {9896#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9897#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:05,913 INFO L273 TraceCheckUtils]: 42: Hoare triple {9897#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9898#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:05,914 INFO L273 TraceCheckUtils]: 43: Hoare triple {9898#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9899#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:05,915 INFO L273 TraceCheckUtils]: 44: Hoare triple {9899#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9900#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:05,916 INFO L273 TraceCheckUtils]: 45: Hoare triple {9900#(<= main_~i~0 39)} assume !(~i~0 < 100000); {9860#false} is VALID [2018-11-23 12:11:05,916 INFO L273 TraceCheckUtils]: 46: Hoare triple {9860#false} ~i~0 := 1; {9860#false} is VALID [2018-11-23 12:11:05,916 INFO L273 TraceCheckUtils]: 47: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:11:05,917 INFO L273 TraceCheckUtils]: 48: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:11:05,917 INFO L273 TraceCheckUtils]: 49: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:11:05,917 INFO L273 TraceCheckUtils]: 50: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:11:05,917 INFO L273 TraceCheckUtils]: 51: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:11:05,917 INFO L273 TraceCheckUtils]: 52: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:11:05,918 INFO L273 TraceCheckUtils]: 53: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:11:05,918 INFO L273 TraceCheckUtils]: 54: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {9860#false} is VALID [2018-11-23 12:11:05,918 INFO L273 TraceCheckUtils]: 55: Hoare triple {9860#false} assume !(~i~0 < 100000); {9860#false} is VALID [2018-11-23 12:11:05,918 INFO L273 TraceCheckUtils]: 56: Hoare triple {9860#false} ~i~0 := 1;~j~0 := 0; {9860#false} is VALID [2018-11-23 12:11:05,918 INFO L273 TraceCheckUtils]: 57: Hoare triple {9860#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {9860#false} is VALID [2018-11-23 12:11:05,919 INFO L256 TraceCheckUtils]: 58: Hoare triple {9860#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9860#false} is VALID [2018-11-23 12:11:05,919 INFO L273 TraceCheckUtils]: 59: Hoare triple {9860#false} ~cond := #in~cond; {9860#false} is VALID [2018-11-23 12:11:05,919 INFO L273 TraceCheckUtils]: 60: Hoare triple {9860#false} assume 0 == ~cond; {9860#false} is VALID [2018-11-23 12:11:05,919 INFO L273 TraceCheckUtils]: 61: Hoare triple {9860#false} assume !false; {9860#false} is VALID [2018-11-23 12:11:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:11:05,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:05,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 12:11:05,950 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 62 [2018-11-23 12:11:05,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:05,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:11:05,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:05,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:11:05,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:11:05,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:11:05,997 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 43 states. [2018-11-23 12:11:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:10,046 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2018-11-23 12:11:10,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:11:10,046 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 62 [2018-11-23 12:11:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:11:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2018-11-23 12:11:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:11:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2018-11-23 12:11:10,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 100 transitions. [2018-11-23 12:11:10,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:10,273 INFO L225 Difference]: With dead ends: 102 [2018-11-23 12:11:10,273 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 12:11:10,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:11:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 12:11:10,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2018-11-23 12:11:10,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:10,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 67 states. [2018-11-23 12:11:10,326 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 67 states. [2018-11-23 12:11:10,326 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 67 states. [2018-11-23 12:11:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:10,328 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-11-23 12:11:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-11-23 12:11:10,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:10,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:10,329 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 82 states. [2018-11-23 12:11:10,329 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 82 states. [2018-11-23 12:11:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:10,331 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-11-23 12:11:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-11-23 12:11:10,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:10,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:10,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:10,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:11:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-23 12:11:10,333 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 62 [2018-11-23 12:11:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:10,333 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-23 12:11:10,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:11:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 12:11:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:11:10,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:10,334 INFO L402 BasicCegarLoop]: trace histogram [40, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:10,334 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:10,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:10,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1366341850, now seen corresponding path program 24 times [2018-11-23 12:11:10,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:10,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:10,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:10,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:10,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:11,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {10556#true} call ULTIMATE.init(); {10556#true} is VALID [2018-11-23 12:11:11,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {10556#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10556#true} is VALID [2018-11-23 12:11:11,913 INFO L273 TraceCheckUtils]: 2: Hoare triple {10556#true} assume true; {10556#true} is VALID [2018-11-23 12:11:11,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10556#true} {10556#true} #60#return; {10556#true} is VALID [2018-11-23 12:11:11,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {10556#true} call #t~ret4 := main(); {10556#true} is VALID [2018-11-23 12:11:11,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {10556#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {10558#(= main_~i~0 0)} is VALID [2018-11-23 12:11:11,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {10558#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10559#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:11,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {10559#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10560#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:11,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {10560#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10561#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:11,919 INFO L273 TraceCheckUtils]: 9: Hoare triple {10561#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10562#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:11,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {10562#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10563#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:11,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {10563#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10564#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:11,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {10564#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10565#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:11,923 INFO L273 TraceCheckUtils]: 13: Hoare triple {10565#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10566#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:11,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {10566#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10567#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:11,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {10567#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10568#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:11,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {10568#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10569#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:11,927 INFO L273 TraceCheckUtils]: 17: Hoare triple {10569#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10570#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:11,928 INFO L273 TraceCheckUtils]: 18: Hoare triple {10570#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10571#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:11,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {10571#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10572#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:11,930 INFO L273 TraceCheckUtils]: 20: Hoare triple {10572#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10573#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:11,931 INFO L273 TraceCheckUtils]: 21: Hoare triple {10573#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10574#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:11,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {10574#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10575#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:11,933 INFO L273 TraceCheckUtils]: 23: Hoare triple {10575#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10576#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:11,934 INFO L273 TraceCheckUtils]: 24: Hoare triple {10576#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10577#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:11,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {10577#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10578#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:11,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {10578#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10579#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:11,937 INFO L273 TraceCheckUtils]: 27: Hoare triple {10579#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10580#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:11,938 INFO L273 TraceCheckUtils]: 28: Hoare triple {10580#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10581#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:11,939 INFO L273 TraceCheckUtils]: 29: Hoare triple {10581#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10582#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:11,940 INFO L273 TraceCheckUtils]: 30: Hoare triple {10582#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10583#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:11,941 INFO L273 TraceCheckUtils]: 31: Hoare triple {10583#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10584#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:11,942 INFO L273 TraceCheckUtils]: 32: Hoare triple {10584#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10585#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:11,943 INFO L273 TraceCheckUtils]: 33: Hoare triple {10585#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10586#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:11,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {10586#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10587#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:11,945 INFO L273 TraceCheckUtils]: 35: Hoare triple {10587#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10588#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:11,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {10588#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10589#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:11,947 INFO L273 TraceCheckUtils]: 37: Hoare triple {10589#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10590#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:11,948 INFO L273 TraceCheckUtils]: 38: Hoare triple {10590#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10591#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:11,949 INFO L273 TraceCheckUtils]: 39: Hoare triple {10591#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10592#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:11,950 INFO L273 TraceCheckUtils]: 40: Hoare triple {10592#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10593#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:11,951 INFO L273 TraceCheckUtils]: 41: Hoare triple {10593#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10594#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:11,952 INFO L273 TraceCheckUtils]: 42: Hoare triple {10594#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10595#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:11,953 INFO L273 TraceCheckUtils]: 43: Hoare triple {10595#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10596#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:11,954 INFO L273 TraceCheckUtils]: 44: Hoare triple {10596#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10597#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:11,955 INFO L273 TraceCheckUtils]: 45: Hoare triple {10597#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10598#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:11,956 INFO L273 TraceCheckUtils]: 46: Hoare triple {10598#(<= main_~i~0 40)} assume !(~i~0 < 100000); {10557#false} is VALID [2018-11-23 12:11:11,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {10557#false} ~i~0 := 1; {10557#false} is VALID [2018-11-23 12:11:11,956 INFO L273 TraceCheckUtils]: 48: Hoare triple {10557#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10557#false} is VALID [2018-11-23 12:11:11,956 INFO L273 TraceCheckUtils]: 49: Hoare triple {10557#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10557#false} is VALID [2018-11-23 12:11:11,957 INFO L273 TraceCheckUtils]: 50: Hoare triple {10557#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10557#false} is VALID [2018-11-23 12:11:11,957 INFO L273 TraceCheckUtils]: 51: Hoare triple {10557#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10557#false} is VALID [2018-11-23 12:11:11,957 INFO L273 TraceCheckUtils]: 52: Hoare triple {10557#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10557#false} is VALID [2018-11-23 12:11:11,957 INFO L273 TraceCheckUtils]: 53: Hoare triple {10557#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10557#false} is VALID [2018-11-23 12:11:11,957 INFO L273 TraceCheckUtils]: 54: Hoare triple {10557#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10557#false} is VALID [2018-11-23 12:11:11,958 INFO L273 TraceCheckUtils]: 55: Hoare triple {10557#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10557#false} is VALID [2018-11-23 12:11:11,958 INFO L273 TraceCheckUtils]: 56: Hoare triple {10557#false} assume !(~i~0 < 100000); {10557#false} is VALID [2018-11-23 12:11:11,958 INFO L273 TraceCheckUtils]: 57: Hoare triple {10557#false} ~i~0 := 1;~j~0 := 0; {10557#false} is VALID [2018-11-23 12:11:11,958 INFO L273 TraceCheckUtils]: 58: Hoare triple {10557#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {10557#false} is VALID [2018-11-23 12:11:11,958 INFO L256 TraceCheckUtils]: 59: Hoare triple {10557#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10557#false} is VALID [2018-11-23 12:11:11,959 INFO L273 TraceCheckUtils]: 60: Hoare triple {10557#false} ~cond := #in~cond; {10557#false} is VALID [2018-11-23 12:11:11,959 INFO L273 TraceCheckUtils]: 61: Hoare triple {10557#false} assume 0 == ~cond; {10557#false} is VALID [2018-11-23 12:11:11,959 INFO L273 TraceCheckUtils]: 62: Hoare triple {10557#false} assume !false; {10557#false} is VALID [2018-11-23 12:11:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:11:11,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:11,962 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:11,972 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:11:14,778 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:11:14,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:14,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:15,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {10556#true} call ULTIMATE.init(); {10556#true} is VALID [2018-11-23 12:11:15,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {10556#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10556#true} is VALID [2018-11-23 12:11:15,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {10556#true} assume true; {10556#true} is VALID [2018-11-23 12:11:15,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10556#true} {10556#true} #60#return; {10556#true} is VALID [2018-11-23 12:11:15,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {10556#true} call #t~ret4 := main(); {10556#true} is VALID [2018-11-23 12:11:15,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {10556#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {10556#true} is VALID [2018-11-23 12:11:15,230 INFO L273 TraceCheckUtils]: 6: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,231 INFO L273 TraceCheckUtils]: 7: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,231 INFO L273 TraceCheckUtils]: 12: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,231 INFO L273 TraceCheckUtils]: 13: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,232 INFO L273 TraceCheckUtils]: 17: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,232 INFO L273 TraceCheckUtils]: 18: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,232 INFO L273 TraceCheckUtils]: 19: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,232 INFO L273 TraceCheckUtils]: 21: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,232 INFO L273 TraceCheckUtils]: 24: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,233 INFO L273 TraceCheckUtils]: 25: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,233 INFO L273 TraceCheckUtils]: 31: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,234 INFO L273 TraceCheckUtils]: 33: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,234 INFO L273 TraceCheckUtils]: 34: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,234 INFO L273 TraceCheckUtils]: 35: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,234 INFO L273 TraceCheckUtils]: 37: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,234 INFO L273 TraceCheckUtils]: 39: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,234 INFO L273 TraceCheckUtils]: 40: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,234 INFO L273 TraceCheckUtils]: 41: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,235 INFO L273 TraceCheckUtils]: 42: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,235 INFO L273 TraceCheckUtils]: 43: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,235 INFO L273 TraceCheckUtils]: 44: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,235 INFO L273 TraceCheckUtils]: 45: Hoare triple {10556#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10556#true} is VALID [2018-11-23 12:11:15,235 INFO L273 TraceCheckUtils]: 46: Hoare triple {10556#true} assume !(~i~0 < 100000); {10556#true} is VALID [2018-11-23 12:11:15,235 INFO L273 TraceCheckUtils]: 47: Hoare triple {10556#true} ~i~0 := 1; {10559#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:15,236 INFO L273 TraceCheckUtils]: 48: Hoare triple {10559#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10567#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:15,237 INFO L273 TraceCheckUtils]: 49: Hoare triple {10567#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10575#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:15,237 INFO L273 TraceCheckUtils]: 50: Hoare triple {10575#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10583#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:15,238 INFO L273 TraceCheckUtils]: 51: Hoare triple {10583#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10591#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:15,239 INFO L273 TraceCheckUtils]: 52: Hoare triple {10591#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10758#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:15,239 INFO L273 TraceCheckUtils]: 53: Hoare triple {10758#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10762#(<= main_~i~0 49)} is VALID [2018-11-23 12:11:15,240 INFO L273 TraceCheckUtils]: 54: Hoare triple {10762#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10766#(<= main_~i~0 57)} is VALID [2018-11-23 12:11:15,241 INFO L273 TraceCheckUtils]: 55: Hoare triple {10766#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {10770#(<= main_~i~0 65)} is VALID [2018-11-23 12:11:15,242 INFO L273 TraceCheckUtils]: 56: Hoare triple {10770#(<= main_~i~0 65)} assume !(~i~0 < 100000); {10557#false} is VALID [2018-11-23 12:11:15,242 INFO L273 TraceCheckUtils]: 57: Hoare triple {10557#false} ~i~0 := 1;~j~0 := 0; {10557#false} is VALID [2018-11-23 12:11:15,242 INFO L273 TraceCheckUtils]: 58: Hoare triple {10557#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {10557#false} is VALID [2018-11-23 12:11:15,243 INFO L256 TraceCheckUtils]: 59: Hoare triple {10557#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10557#false} is VALID [2018-11-23 12:11:15,243 INFO L273 TraceCheckUtils]: 60: Hoare triple {10557#false} ~cond := #in~cond; {10557#false} is VALID [2018-11-23 12:11:15,243 INFO L273 TraceCheckUtils]: 61: Hoare triple {10557#false} assume 0 == ~cond; {10557#false} is VALID [2018-11-23 12:11:15,243 INFO L273 TraceCheckUtils]: 62: Hoare triple {10557#false} assume !false; {10557#false} is VALID [2018-11-23 12:11:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-11-23 12:11:15,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:15,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 11] total 47 [2018-11-23 12:11:15,268 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 63 [2018-11-23 12:11:15,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:15,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 12:11:15,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:15,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 12:11:15,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 12:11:15,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:11:15,330 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 47 states. [2018-11-23 12:11:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:16,942 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2018-11-23 12:11:16,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 12:11:16,942 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 63 [2018-11-23 12:11:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:11:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 130 transitions. [2018-11-23 12:11:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:11:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 130 transitions. [2018-11-23 12:11:16,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 130 transitions. [2018-11-23 12:11:17,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:17,074 INFO L225 Difference]: With dead ends: 120 [2018-11-23 12:11:17,074 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 12:11:17,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:11:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 12:11:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2018-11-23 12:11:17,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:17,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 73 states. [2018-11-23 12:11:17,163 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 73 states. [2018-11-23 12:11:17,163 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 73 states. [2018-11-23 12:11:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:17,165 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-11-23 12:11:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-11-23 12:11:17,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:17,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:17,166 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 100 states. [2018-11-23 12:11:17,166 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 100 states. [2018-11-23 12:11:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:17,168 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-11-23 12:11:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-11-23 12:11:17,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:17,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:17,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:17,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 12:11:17,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-11-23 12:11:17,170 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 63 [2018-11-23 12:11:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:17,170 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-11-23 12:11:17,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 12:11:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-11-23 12:11:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:11:17,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:17,171 INFO L402 BasicCegarLoop]: trace histogram [45, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:17,172 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:17,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:17,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1632849595, now seen corresponding path program 25 times [2018-11-23 12:11:17,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:17,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:17,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:17,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:17,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:18,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {11340#true} call ULTIMATE.init(); {11340#true} is VALID [2018-11-23 12:11:18,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {11340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11340#true} is VALID [2018-11-23 12:11:18,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {11340#true} assume true; {11340#true} is VALID [2018-11-23 12:11:18,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11340#true} {11340#true} #60#return; {11340#true} is VALID [2018-11-23 12:11:18,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {11340#true} call #t~ret4 := main(); {11340#true} is VALID [2018-11-23 12:11:18,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {11340#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {11342#(= main_~i~0 0)} is VALID [2018-11-23 12:11:18,994 INFO L273 TraceCheckUtils]: 6: Hoare triple {11342#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11343#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:18,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {11343#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11344#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:18,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {11344#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11345#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:18,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {11345#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11346#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:18,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {11346#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11347#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:18,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {11347#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11348#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:18,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {11348#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11349#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:18,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {11349#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11350#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:19,000 INFO L273 TraceCheckUtils]: 14: Hoare triple {11350#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11351#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:19,001 INFO L273 TraceCheckUtils]: 15: Hoare triple {11351#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11352#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:19,002 INFO L273 TraceCheckUtils]: 16: Hoare triple {11352#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11353#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:19,003 INFO L273 TraceCheckUtils]: 17: Hoare triple {11353#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11354#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:19,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {11354#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11355#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:19,005 INFO L273 TraceCheckUtils]: 19: Hoare triple {11355#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11356#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:19,006 INFO L273 TraceCheckUtils]: 20: Hoare triple {11356#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11357#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:19,007 INFO L273 TraceCheckUtils]: 21: Hoare triple {11357#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11358#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:19,008 INFO L273 TraceCheckUtils]: 22: Hoare triple {11358#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11359#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:19,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {11359#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11360#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:19,010 INFO L273 TraceCheckUtils]: 24: Hoare triple {11360#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11361#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:19,011 INFO L273 TraceCheckUtils]: 25: Hoare triple {11361#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11362#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:19,012 INFO L273 TraceCheckUtils]: 26: Hoare triple {11362#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11363#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:19,014 INFO L273 TraceCheckUtils]: 27: Hoare triple {11363#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11364#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:19,015 INFO L273 TraceCheckUtils]: 28: Hoare triple {11364#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11365#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:19,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {11365#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11366#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:19,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {11366#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11367#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:19,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {11367#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11368#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:19,019 INFO L273 TraceCheckUtils]: 32: Hoare triple {11368#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11369#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:19,020 INFO L273 TraceCheckUtils]: 33: Hoare triple {11369#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11370#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:19,021 INFO L273 TraceCheckUtils]: 34: Hoare triple {11370#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11371#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:19,022 INFO L273 TraceCheckUtils]: 35: Hoare triple {11371#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11372#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:19,023 INFO L273 TraceCheckUtils]: 36: Hoare triple {11372#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11373#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:19,024 INFO L273 TraceCheckUtils]: 37: Hoare triple {11373#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11374#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:19,025 INFO L273 TraceCheckUtils]: 38: Hoare triple {11374#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11375#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:19,026 INFO L273 TraceCheckUtils]: 39: Hoare triple {11375#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11376#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:19,027 INFO L273 TraceCheckUtils]: 40: Hoare triple {11376#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11377#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:19,028 INFO L273 TraceCheckUtils]: 41: Hoare triple {11377#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11378#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:19,029 INFO L273 TraceCheckUtils]: 42: Hoare triple {11378#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11379#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:19,030 INFO L273 TraceCheckUtils]: 43: Hoare triple {11379#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11380#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:19,031 INFO L273 TraceCheckUtils]: 44: Hoare triple {11380#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11381#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:19,032 INFO L273 TraceCheckUtils]: 45: Hoare triple {11381#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11382#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:19,033 INFO L273 TraceCheckUtils]: 46: Hoare triple {11382#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11383#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:19,034 INFO L273 TraceCheckUtils]: 47: Hoare triple {11383#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11384#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:19,035 INFO L273 TraceCheckUtils]: 48: Hoare triple {11384#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11385#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:19,036 INFO L273 TraceCheckUtils]: 49: Hoare triple {11385#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11386#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:19,037 INFO L273 TraceCheckUtils]: 50: Hoare triple {11386#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11387#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:19,037 INFO L273 TraceCheckUtils]: 51: Hoare triple {11387#(<= main_~i~0 45)} assume !(~i~0 < 100000); {11341#false} is VALID [2018-11-23 12:11:19,038 INFO L273 TraceCheckUtils]: 52: Hoare triple {11341#false} ~i~0 := 1; {11341#false} is VALID [2018-11-23 12:11:19,038 INFO L273 TraceCheckUtils]: 53: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,038 INFO L273 TraceCheckUtils]: 54: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,038 INFO L273 TraceCheckUtils]: 55: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,039 INFO L273 TraceCheckUtils]: 56: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,039 INFO L273 TraceCheckUtils]: 57: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,039 INFO L273 TraceCheckUtils]: 58: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,039 INFO L273 TraceCheckUtils]: 59: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,039 INFO L273 TraceCheckUtils]: 60: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,040 INFO L273 TraceCheckUtils]: 61: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,040 INFO L273 TraceCheckUtils]: 62: Hoare triple {11341#false} assume !(~i~0 < 100000); {11341#false} is VALID [2018-11-23 12:11:19,040 INFO L273 TraceCheckUtils]: 63: Hoare triple {11341#false} ~i~0 := 1;~j~0 := 0; {11341#false} is VALID [2018-11-23 12:11:19,040 INFO L273 TraceCheckUtils]: 64: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {11341#false} is VALID [2018-11-23 12:11:19,040 INFO L256 TraceCheckUtils]: 65: Hoare triple {11341#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11341#false} is VALID [2018-11-23 12:11:19,041 INFO L273 TraceCheckUtils]: 66: Hoare triple {11341#false} ~cond := #in~cond; {11341#false} is VALID [2018-11-23 12:11:19,041 INFO L273 TraceCheckUtils]: 67: Hoare triple {11341#false} assume 0 == ~cond; {11341#false} is VALID [2018-11-23 12:11:19,041 INFO L273 TraceCheckUtils]: 68: Hoare triple {11341#false} assume !false; {11341#false} is VALID [2018-11-23 12:11:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:11:19,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:19,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:19,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:19,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:19,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {11340#true} call ULTIMATE.init(); {11340#true} is VALID [2018-11-23 12:11:19,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {11340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11340#true} is VALID [2018-11-23 12:11:19,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {11340#true} assume true; {11340#true} is VALID [2018-11-23 12:11:19,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11340#true} {11340#true} #60#return; {11340#true} is VALID [2018-11-23 12:11:19,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {11340#true} call #t~ret4 := main(); {11340#true} is VALID [2018-11-23 12:11:19,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {11340#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {11406#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:19,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {11406#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11343#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:19,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {11343#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11344#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:19,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {11344#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11345#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:19,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {11345#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11346#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:19,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {11346#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11347#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:19,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {11347#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11348#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:19,451 INFO L273 TraceCheckUtils]: 12: Hoare triple {11348#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11349#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:19,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {11349#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11350#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:19,453 INFO L273 TraceCheckUtils]: 14: Hoare triple {11350#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11351#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:19,454 INFO L273 TraceCheckUtils]: 15: Hoare triple {11351#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11352#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:19,455 INFO L273 TraceCheckUtils]: 16: Hoare triple {11352#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11353#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:19,456 INFO L273 TraceCheckUtils]: 17: Hoare triple {11353#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11354#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:19,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {11354#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11355#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:19,458 INFO L273 TraceCheckUtils]: 19: Hoare triple {11355#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11356#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:19,459 INFO L273 TraceCheckUtils]: 20: Hoare triple {11356#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11357#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:19,460 INFO L273 TraceCheckUtils]: 21: Hoare triple {11357#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11358#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:19,461 INFO L273 TraceCheckUtils]: 22: Hoare triple {11358#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11359#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:19,462 INFO L273 TraceCheckUtils]: 23: Hoare triple {11359#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11360#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:19,463 INFO L273 TraceCheckUtils]: 24: Hoare triple {11360#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11361#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:19,464 INFO L273 TraceCheckUtils]: 25: Hoare triple {11361#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11362#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:19,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {11362#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11363#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:19,466 INFO L273 TraceCheckUtils]: 27: Hoare triple {11363#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11364#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:19,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {11364#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11365#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:19,468 INFO L273 TraceCheckUtils]: 29: Hoare triple {11365#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11366#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:19,469 INFO L273 TraceCheckUtils]: 30: Hoare triple {11366#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11367#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:19,470 INFO L273 TraceCheckUtils]: 31: Hoare triple {11367#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11368#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:19,471 INFO L273 TraceCheckUtils]: 32: Hoare triple {11368#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11369#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:19,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {11369#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11370#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:19,473 INFO L273 TraceCheckUtils]: 34: Hoare triple {11370#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11371#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:19,474 INFO L273 TraceCheckUtils]: 35: Hoare triple {11371#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11372#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:19,475 INFO L273 TraceCheckUtils]: 36: Hoare triple {11372#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11373#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:19,476 INFO L273 TraceCheckUtils]: 37: Hoare triple {11373#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11374#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:19,477 INFO L273 TraceCheckUtils]: 38: Hoare triple {11374#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11375#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:19,478 INFO L273 TraceCheckUtils]: 39: Hoare triple {11375#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11376#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:19,479 INFO L273 TraceCheckUtils]: 40: Hoare triple {11376#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11377#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:19,480 INFO L273 TraceCheckUtils]: 41: Hoare triple {11377#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11378#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:19,481 INFO L273 TraceCheckUtils]: 42: Hoare triple {11378#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11379#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:19,482 INFO L273 TraceCheckUtils]: 43: Hoare triple {11379#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11380#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:19,483 INFO L273 TraceCheckUtils]: 44: Hoare triple {11380#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11381#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:19,484 INFO L273 TraceCheckUtils]: 45: Hoare triple {11381#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11382#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:19,485 INFO L273 TraceCheckUtils]: 46: Hoare triple {11382#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11383#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:19,486 INFO L273 TraceCheckUtils]: 47: Hoare triple {11383#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11384#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:19,487 INFO L273 TraceCheckUtils]: 48: Hoare triple {11384#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11385#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:19,488 INFO L273 TraceCheckUtils]: 49: Hoare triple {11385#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11386#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:19,489 INFO L273 TraceCheckUtils]: 50: Hoare triple {11386#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11387#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:19,490 INFO L273 TraceCheckUtils]: 51: Hoare triple {11387#(<= main_~i~0 45)} assume !(~i~0 < 100000); {11341#false} is VALID [2018-11-23 12:11:19,490 INFO L273 TraceCheckUtils]: 52: Hoare triple {11341#false} ~i~0 := 1; {11341#false} is VALID [2018-11-23 12:11:19,490 INFO L273 TraceCheckUtils]: 53: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,491 INFO L273 TraceCheckUtils]: 54: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,491 INFO L273 TraceCheckUtils]: 55: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,491 INFO L273 TraceCheckUtils]: 56: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,491 INFO L273 TraceCheckUtils]: 57: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,491 INFO L273 TraceCheckUtils]: 58: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,492 INFO L273 TraceCheckUtils]: 59: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,492 INFO L273 TraceCheckUtils]: 60: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,492 INFO L273 TraceCheckUtils]: 61: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {11341#false} is VALID [2018-11-23 12:11:19,492 INFO L273 TraceCheckUtils]: 62: Hoare triple {11341#false} assume !(~i~0 < 100000); {11341#false} is VALID [2018-11-23 12:11:19,492 INFO L273 TraceCheckUtils]: 63: Hoare triple {11341#false} ~i~0 := 1;~j~0 := 0; {11341#false} is VALID [2018-11-23 12:11:19,493 INFO L273 TraceCheckUtils]: 64: Hoare triple {11341#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {11341#false} is VALID [2018-11-23 12:11:19,493 INFO L256 TraceCheckUtils]: 65: Hoare triple {11341#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11341#false} is VALID [2018-11-23 12:11:19,493 INFO L273 TraceCheckUtils]: 66: Hoare triple {11341#false} ~cond := #in~cond; {11341#false} is VALID [2018-11-23 12:11:19,493 INFO L273 TraceCheckUtils]: 67: Hoare triple {11341#false} assume 0 == ~cond; {11341#false} is VALID [2018-11-23 12:11:19,493 INFO L273 TraceCheckUtils]: 68: Hoare triple {11341#false} assume !false; {11341#false} is VALID [2018-11-23 12:11:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:11:19,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:19,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-11-23 12:11:19,516 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 69 [2018-11-23 12:11:19,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:19,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:11:19,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:19,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:11:19,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:11:19,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:11:19,565 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 49 states. [2018-11-23 12:11:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:21,316 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2018-11-23 12:11:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:11:21,316 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 69 [2018-11-23 12:11:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:11:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 111 transitions. [2018-11-23 12:11:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:11:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 111 transitions. [2018-11-23 12:11:21,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 111 transitions. [2018-11-23 12:11:21,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:21,424 INFO L225 Difference]: With dead ends: 113 [2018-11-23 12:11:21,425 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 12:11:21,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:11:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 12:11:21,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2018-11-23 12:11:21,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:21,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 74 states. [2018-11-23 12:11:21,477 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 74 states. [2018-11-23 12:11:21,478 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 74 states. [2018-11-23 12:11:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:21,479 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2018-11-23 12:11:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-11-23 12:11:21,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:21,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:21,480 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 92 states. [2018-11-23 12:11:21,480 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 92 states. [2018-11-23 12:11:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:21,481 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2018-11-23 12:11:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-11-23 12:11:21,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:21,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:21,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:21,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:11:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-11-23 12:11:21,483 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 69 [2018-11-23 12:11:21,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:21,483 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-11-23 12:11:21,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:11:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-23 12:11:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:11:21,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:21,484 INFO L402 BasicCegarLoop]: trace histogram [46, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:21,484 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:21,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:21,484 INFO L82 PathProgramCache]: Analyzing trace with hash -492952983, now seen corresponding path program 26 times [2018-11-23 12:11:21,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:21,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:21,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:21,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:21,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:22,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {12119#true} call ULTIMATE.init(); {12119#true} is VALID [2018-11-23 12:11:22,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {12119#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12119#true} is VALID [2018-11-23 12:11:22,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {12119#true} assume true; {12119#true} is VALID [2018-11-23 12:11:22,632 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12119#true} {12119#true} #60#return; {12119#true} is VALID [2018-11-23 12:11:22,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {12119#true} call #t~ret4 := main(); {12119#true} is VALID [2018-11-23 12:11:22,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {12119#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {12121#(= main_~i~0 0)} is VALID [2018-11-23 12:11:22,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {12121#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12122#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:22,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {12122#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12123#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:22,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {12123#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12124#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:22,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {12124#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12125#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:22,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {12125#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12126#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:22,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {12126#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12127#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:22,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {12127#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12128#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:22,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {12128#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12129#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:22,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {12129#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12130#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:22,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {12130#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12131#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:22,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {12131#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12132#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:22,644 INFO L273 TraceCheckUtils]: 17: Hoare triple {12132#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12133#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:22,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {12133#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12134#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:22,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {12134#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12135#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:22,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {12135#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12136#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:22,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {12136#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:22,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {12137#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12138#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:22,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {12138#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12139#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:22,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {12139#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12140#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:22,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {12140#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12141#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:22,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {12141#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12142#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:22,654 INFO L273 TraceCheckUtils]: 27: Hoare triple {12142#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12143#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:22,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {12143#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12144#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:22,656 INFO L273 TraceCheckUtils]: 29: Hoare triple {12144#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12145#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:22,657 INFO L273 TraceCheckUtils]: 30: Hoare triple {12145#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12146#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:22,658 INFO L273 TraceCheckUtils]: 31: Hoare triple {12146#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12147#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:22,659 INFO L273 TraceCheckUtils]: 32: Hoare triple {12147#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12148#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:22,660 INFO L273 TraceCheckUtils]: 33: Hoare triple {12148#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12149#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:22,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {12149#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12150#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:22,662 INFO L273 TraceCheckUtils]: 35: Hoare triple {12150#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12151#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:22,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {12151#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12152#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:22,664 INFO L273 TraceCheckUtils]: 37: Hoare triple {12152#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12153#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:22,665 INFO L273 TraceCheckUtils]: 38: Hoare triple {12153#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12154#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:22,666 INFO L273 TraceCheckUtils]: 39: Hoare triple {12154#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12155#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:22,667 INFO L273 TraceCheckUtils]: 40: Hoare triple {12155#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12156#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:22,668 INFO L273 TraceCheckUtils]: 41: Hoare triple {12156#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12157#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:22,669 INFO L273 TraceCheckUtils]: 42: Hoare triple {12157#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12158#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:22,670 INFO L273 TraceCheckUtils]: 43: Hoare triple {12158#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12159#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:22,671 INFO L273 TraceCheckUtils]: 44: Hoare triple {12159#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12160#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:22,672 INFO L273 TraceCheckUtils]: 45: Hoare triple {12160#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12161#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:22,673 INFO L273 TraceCheckUtils]: 46: Hoare triple {12161#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12162#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:22,674 INFO L273 TraceCheckUtils]: 47: Hoare triple {12162#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12163#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:22,675 INFO L273 TraceCheckUtils]: 48: Hoare triple {12163#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12164#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:22,676 INFO L273 TraceCheckUtils]: 49: Hoare triple {12164#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12165#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:22,677 INFO L273 TraceCheckUtils]: 50: Hoare triple {12165#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12166#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:22,678 INFO L273 TraceCheckUtils]: 51: Hoare triple {12166#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12167#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:22,679 INFO L273 TraceCheckUtils]: 52: Hoare triple {12167#(<= main_~i~0 46)} assume !(~i~0 < 100000); {12120#false} is VALID [2018-11-23 12:11:22,679 INFO L273 TraceCheckUtils]: 53: Hoare triple {12120#false} ~i~0 := 1; {12120#false} is VALID [2018-11-23 12:11:22,679 INFO L273 TraceCheckUtils]: 54: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:22,679 INFO L273 TraceCheckUtils]: 55: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:22,680 INFO L273 TraceCheckUtils]: 56: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:22,680 INFO L273 TraceCheckUtils]: 57: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:22,680 INFO L273 TraceCheckUtils]: 58: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:22,680 INFO L273 TraceCheckUtils]: 59: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:22,680 INFO L273 TraceCheckUtils]: 60: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:22,681 INFO L273 TraceCheckUtils]: 61: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:22,681 INFO L273 TraceCheckUtils]: 62: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:22,681 INFO L273 TraceCheckUtils]: 63: Hoare triple {12120#false} assume !(~i~0 < 100000); {12120#false} is VALID [2018-11-23 12:11:22,681 INFO L273 TraceCheckUtils]: 64: Hoare triple {12120#false} ~i~0 := 1;~j~0 := 0; {12120#false} is VALID [2018-11-23 12:11:22,681 INFO L273 TraceCheckUtils]: 65: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {12120#false} is VALID [2018-11-23 12:11:22,682 INFO L256 TraceCheckUtils]: 66: Hoare triple {12120#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12120#false} is VALID [2018-11-23 12:11:22,682 INFO L273 TraceCheckUtils]: 67: Hoare triple {12120#false} ~cond := #in~cond; {12120#false} is VALID [2018-11-23 12:11:22,682 INFO L273 TraceCheckUtils]: 68: Hoare triple {12120#false} assume 0 == ~cond; {12120#false} is VALID [2018-11-23 12:11:22,682 INFO L273 TraceCheckUtils]: 69: Hoare triple {12120#false} assume !false; {12120#false} is VALID [2018-11-23 12:11:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:11:22,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:22,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:22,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:11:22,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:11:22,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:22,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:23,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {12119#true} call ULTIMATE.init(); {12119#true} is VALID [2018-11-23 12:11:23,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {12119#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12119#true} is VALID [2018-11-23 12:11:23,092 INFO L273 TraceCheckUtils]: 2: Hoare triple {12119#true} assume true; {12119#true} is VALID [2018-11-23 12:11:23,092 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12119#true} {12119#true} #60#return; {12119#true} is VALID [2018-11-23 12:11:23,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {12119#true} call #t~ret4 := main(); {12119#true} is VALID [2018-11-23 12:11:23,093 INFO L273 TraceCheckUtils]: 5: Hoare triple {12119#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {12186#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:23,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {12186#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12122#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:23,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {12122#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12123#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:23,095 INFO L273 TraceCheckUtils]: 8: Hoare triple {12123#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12124#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:23,096 INFO L273 TraceCheckUtils]: 9: Hoare triple {12124#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12125#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:23,097 INFO L273 TraceCheckUtils]: 10: Hoare triple {12125#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12126#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:23,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {12126#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12127#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:23,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {12127#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12128#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:23,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {12128#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12129#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:23,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {12129#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12130#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:23,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {12130#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12131#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:23,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {12131#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12132#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:23,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {12132#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12133#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:23,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {12133#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12134#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:23,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {12134#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12135#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:23,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {12135#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12136#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:23,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {12136#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:23,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {12137#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12138#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:23,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {12138#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12139#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:23,113 INFO L273 TraceCheckUtils]: 24: Hoare triple {12139#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12140#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:23,114 INFO L273 TraceCheckUtils]: 25: Hoare triple {12140#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12141#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:23,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {12141#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12142#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:23,116 INFO L273 TraceCheckUtils]: 27: Hoare triple {12142#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12143#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:23,117 INFO L273 TraceCheckUtils]: 28: Hoare triple {12143#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12144#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:23,118 INFO L273 TraceCheckUtils]: 29: Hoare triple {12144#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12145#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:23,119 INFO L273 TraceCheckUtils]: 30: Hoare triple {12145#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12146#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:23,120 INFO L273 TraceCheckUtils]: 31: Hoare triple {12146#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12147#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:23,121 INFO L273 TraceCheckUtils]: 32: Hoare triple {12147#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12148#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:23,123 INFO L273 TraceCheckUtils]: 33: Hoare triple {12148#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12149#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:23,124 INFO L273 TraceCheckUtils]: 34: Hoare triple {12149#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12150#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:23,125 INFO L273 TraceCheckUtils]: 35: Hoare triple {12150#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12151#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:23,126 INFO L273 TraceCheckUtils]: 36: Hoare triple {12151#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12152#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:23,127 INFO L273 TraceCheckUtils]: 37: Hoare triple {12152#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12153#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:23,128 INFO L273 TraceCheckUtils]: 38: Hoare triple {12153#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12154#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:23,129 INFO L273 TraceCheckUtils]: 39: Hoare triple {12154#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12155#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:23,130 INFO L273 TraceCheckUtils]: 40: Hoare triple {12155#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12156#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:23,131 INFO L273 TraceCheckUtils]: 41: Hoare triple {12156#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12157#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:23,132 INFO L273 TraceCheckUtils]: 42: Hoare triple {12157#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12158#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:23,133 INFO L273 TraceCheckUtils]: 43: Hoare triple {12158#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12159#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:23,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {12159#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12160#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:23,135 INFO L273 TraceCheckUtils]: 45: Hoare triple {12160#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12161#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:23,136 INFO L273 TraceCheckUtils]: 46: Hoare triple {12161#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12162#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:23,137 INFO L273 TraceCheckUtils]: 47: Hoare triple {12162#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12163#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:23,138 INFO L273 TraceCheckUtils]: 48: Hoare triple {12163#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12164#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:23,139 INFO L273 TraceCheckUtils]: 49: Hoare triple {12164#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12165#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:23,140 INFO L273 TraceCheckUtils]: 50: Hoare triple {12165#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12166#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:23,141 INFO L273 TraceCheckUtils]: 51: Hoare triple {12166#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12167#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:23,142 INFO L273 TraceCheckUtils]: 52: Hoare triple {12167#(<= main_~i~0 46)} assume !(~i~0 < 100000); {12120#false} is VALID [2018-11-23 12:11:23,142 INFO L273 TraceCheckUtils]: 53: Hoare triple {12120#false} ~i~0 := 1; {12120#false} is VALID [2018-11-23 12:11:23,142 INFO L273 TraceCheckUtils]: 54: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:23,142 INFO L273 TraceCheckUtils]: 55: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:23,143 INFO L273 TraceCheckUtils]: 56: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:23,143 INFO L273 TraceCheckUtils]: 57: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:23,143 INFO L273 TraceCheckUtils]: 58: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:23,143 INFO L273 TraceCheckUtils]: 59: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:23,143 INFO L273 TraceCheckUtils]: 60: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:23,144 INFO L273 TraceCheckUtils]: 61: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:23,144 INFO L273 TraceCheckUtils]: 62: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12120#false} is VALID [2018-11-23 12:11:23,144 INFO L273 TraceCheckUtils]: 63: Hoare triple {12120#false} assume !(~i~0 < 100000); {12120#false} is VALID [2018-11-23 12:11:23,144 INFO L273 TraceCheckUtils]: 64: Hoare triple {12120#false} ~i~0 := 1;~j~0 := 0; {12120#false} is VALID [2018-11-23 12:11:23,144 INFO L273 TraceCheckUtils]: 65: Hoare triple {12120#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {12120#false} is VALID [2018-11-23 12:11:23,145 INFO L256 TraceCheckUtils]: 66: Hoare triple {12120#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12120#false} is VALID [2018-11-23 12:11:23,145 INFO L273 TraceCheckUtils]: 67: Hoare triple {12120#false} ~cond := #in~cond; {12120#false} is VALID [2018-11-23 12:11:23,145 INFO L273 TraceCheckUtils]: 68: Hoare triple {12120#false} assume 0 == ~cond; {12120#false} is VALID [2018-11-23 12:11:23,145 INFO L273 TraceCheckUtils]: 69: Hoare triple {12120#false} assume !false; {12120#false} is VALID [2018-11-23 12:11:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:11:23,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:23,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2018-11-23 12:11:23,168 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 70 [2018-11-23 12:11:23,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:23,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 12:11:23,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:23,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 12:11:23,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 12:11:23,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:11:23,217 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 50 states. [2018-11-23 12:11:24,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:24,133 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-11-23 12:11:24,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:11:24,133 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 70 [2018-11-23 12:11:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:11:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2018-11-23 12:11:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:11:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2018-11-23 12:11:24,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 112 transitions. [2018-11-23 12:11:24,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:24,240 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:11:24,240 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 12:11:24,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:11:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 12:11:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2018-11-23 12:11:24,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:24,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 75 states. [2018-11-23 12:11:24,310 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 75 states. [2018-11-23 12:11:24,310 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 75 states. [2018-11-23 12:11:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:24,313 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-11-23 12:11:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-11-23 12:11:24,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:24,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:24,313 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 93 states. [2018-11-23 12:11:24,314 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 93 states. [2018-11-23 12:11:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:24,316 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-11-23 12:11:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-11-23 12:11:24,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:24,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:24,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:24,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:11:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-11-23 12:11:24,318 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 70 [2018-11-23 12:11:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:24,318 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-11-23 12:11:24,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 12:11:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-23 12:11:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:11:24,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:24,319 INFO L402 BasicCegarLoop]: trace histogram [47, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:24,320 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:24,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:24,320 INFO L82 PathProgramCache]: Analyzing trace with hash 484103621, now seen corresponding path program 27 times [2018-11-23 12:11:24,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:24,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:24,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:24,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:24,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:25,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2018-11-23 12:11:25,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {12908#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12908#true} is VALID [2018-11-23 12:11:25,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {12908#true} assume true; {12908#true} is VALID [2018-11-23 12:11:25,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12908#true} {12908#true} #60#return; {12908#true} is VALID [2018-11-23 12:11:25,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {12908#true} call #t~ret4 := main(); {12908#true} is VALID [2018-11-23 12:11:25,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {12908#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {12910#(= main_~i~0 0)} is VALID [2018-11-23 12:11:25,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {12910#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12911#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:25,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {12911#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12912#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:25,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {12912#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12913#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:25,805 INFO L273 TraceCheckUtils]: 9: Hoare triple {12913#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12914#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:25,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {12914#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12915#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:25,806 INFO L273 TraceCheckUtils]: 11: Hoare triple {12915#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12916#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:25,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {12916#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12917#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:25,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {12917#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12918#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:25,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {12918#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12919#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:25,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {12919#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12920#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:25,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {12920#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12921#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:25,812 INFO L273 TraceCheckUtils]: 17: Hoare triple {12921#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12922#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:25,813 INFO L273 TraceCheckUtils]: 18: Hoare triple {12922#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12923#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:25,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {12923#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12924#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:25,815 INFO L273 TraceCheckUtils]: 20: Hoare triple {12924#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12925#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:25,816 INFO L273 TraceCheckUtils]: 21: Hoare triple {12925#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12926#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:25,817 INFO L273 TraceCheckUtils]: 22: Hoare triple {12926#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12927#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:25,818 INFO L273 TraceCheckUtils]: 23: Hoare triple {12927#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12928#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:25,819 INFO L273 TraceCheckUtils]: 24: Hoare triple {12928#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12929#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:25,820 INFO L273 TraceCheckUtils]: 25: Hoare triple {12929#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12930#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:25,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {12930#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12931#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:25,822 INFO L273 TraceCheckUtils]: 27: Hoare triple {12931#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12932#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:25,823 INFO L273 TraceCheckUtils]: 28: Hoare triple {12932#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12933#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:25,824 INFO L273 TraceCheckUtils]: 29: Hoare triple {12933#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12934#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:25,825 INFO L273 TraceCheckUtils]: 30: Hoare triple {12934#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12935#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:25,826 INFO L273 TraceCheckUtils]: 31: Hoare triple {12935#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12936#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:25,827 INFO L273 TraceCheckUtils]: 32: Hoare triple {12936#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12937#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:25,828 INFO L273 TraceCheckUtils]: 33: Hoare triple {12937#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12938#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:25,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {12938#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12939#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:25,830 INFO L273 TraceCheckUtils]: 35: Hoare triple {12939#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12940#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:25,832 INFO L273 TraceCheckUtils]: 36: Hoare triple {12940#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12941#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:25,833 INFO L273 TraceCheckUtils]: 37: Hoare triple {12941#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12942#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:25,834 INFO L273 TraceCheckUtils]: 38: Hoare triple {12942#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12943#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:25,835 INFO L273 TraceCheckUtils]: 39: Hoare triple {12943#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12944#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:25,836 INFO L273 TraceCheckUtils]: 40: Hoare triple {12944#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12945#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:25,837 INFO L273 TraceCheckUtils]: 41: Hoare triple {12945#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12946#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:25,838 INFO L273 TraceCheckUtils]: 42: Hoare triple {12946#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12947#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:25,839 INFO L273 TraceCheckUtils]: 43: Hoare triple {12947#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12948#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:25,840 INFO L273 TraceCheckUtils]: 44: Hoare triple {12948#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12949#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:25,841 INFO L273 TraceCheckUtils]: 45: Hoare triple {12949#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12950#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:25,842 INFO L273 TraceCheckUtils]: 46: Hoare triple {12950#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12951#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:25,843 INFO L273 TraceCheckUtils]: 47: Hoare triple {12951#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12952#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:25,844 INFO L273 TraceCheckUtils]: 48: Hoare triple {12952#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12953#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:25,845 INFO L273 TraceCheckUtils]: 49: Hoare triple {12953#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12954#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:25,846 INFO L273 TraceCheckUtils]: 50: Hoare triple {12954#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12955#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:25,847 INFO L273 TraceCheckUtils]: 51: Hoare triple {12955#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12956#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:25,848 INFO L273 TraceCheckUtils]: 52: Hoare triple {12956#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12957#(<= main_~i~0 47)} is VALID [2018-11-23 12:11:25,848 INFO L273 TraceCheckUtils]: 53: Hoare triple {12957#(<= main_~i~0 47)} assume !(~i~0 < 100000); {12909#false} is VALID [2018-11-23 12:11:25,849 INFO L273 TraceCheckUtils]: 54: Hoare triple {12909#false} ~i~0 := 1; {12909#false} is VALID [2018-11-23 12:11:25,849 INFO L273 TraceCheckUtils]: 55: Hoare triple {12909#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12909#false} is VALID [2018-11-23 12:11:25,849 INFO L273 TraceCheckUtils]: 56: Hoare triple {12909#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12909#false} is VALID [2018-11-23 12:11:25,849 INFO L273 TraceCheckUtils]: 57: Hoare triple {12909#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12909#false} is VALID [2018-11-23 12:11:25,850 INFO L273 TraceCheckUtils]: 58: Hoare triple {12909#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12909#false} is VALID [2018-11-23 12:11:25,850 INFO L273 TraceCheckUtils]: 59: Hoare triple {12909#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12909#false} is VALID [2018-11-23 12:11:25,850 INFO L273 TraceCheckUtils]: 60: Hoare triple {12909#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12909#false} is VALID [2018-11-23 12:11:25,850 INFO L273 TraceCheckUtils]: 61: Hoare triple {12909#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12909#false} is VALID [2018-11-23 12:11:25,850 INFO L273 TraceCheckUtils]: 62: Hoare triple {12909#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12909#false} is VALID [2018-11-23 12:11:25,851 INFO L273 TraceCheckUtils]: 63: Hoare triple {12909#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12909#false} is VALID [2018-11-23 12:11:25,851 INFO L273 TraceCheckUtils]: 64: Hoare triple {12909#false} assume !(~i~0 < 100000); {12909#false} is VALID [2018-11-23 12:11:25,851 INFO L273 TraceCheckUtils]: 65: Hoare triple {12909#false} ~i~0 := 1;~j~0 := 0; {12909#false} is VALID [2018-11-23 12:11:25,851 INFO L273 TraceCheckUtils]: 66: Hoare triple {12909#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {12909#false} is VALID [2018-11-23 12:11:25,851 INFO L256 TraceCheckUtils]: 67: Hoare triple {12909#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12909#false} is VALID [2018-11-23 12:11:25,852 INFO L273 TraceCheckUtils]: 68: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2018-11-23 12:11:25,852 INFO L273 TraceCheckUtils]: 69: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2018-11-23 12:11:25,852 INFO L273 TraceCheckUtils]: 70: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2018-11-23 12:11:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:11:25,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:25,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:25,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:11:26,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:11:26,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:26,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:26,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2018-11-23 12:11:26,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {12908#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12908#true} is VALID [2018-11-23 12:11:26,672 INFO L273 TraceCheckUtils]: 2: Hoare triple {12908#true} assume true; {12908#true} is VALID [2018-11-23 12:11:26,672 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12908#true} {12908#true} #60#return; {12908#true} is VALID [2018-11-23 12:11:26,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {12908#true} call #t~ret4 := main(); {12908#true} is VALID [2018-11-23 12:11:26,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {12908#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {12908#true} is VALID [2018-11-23 12:11:26,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,673 INFO L273 TraceCheckUtils]: 9: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,675 INFO L273 TraceCheckUtils]: 21: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,675 INFO L273 TraceCheckUtils]: 22: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,675 INFO L273 TraceCheckUtils]: 23: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,675 INFO L273 TraceCheckUtils]: 26: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,675 INFO L273 TraceCheckUtils]: 27: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,675 INFO L273 TraceCheckUtils]: 28: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,676 INFO L273 TraceCheckUtils]: 29: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,676 INFO L273 TraceCheckUtils]: 30: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,676 INFO L273 TraceCheckUtils]: 31: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,676 INFO L273 TraceCheckUtils]: 32: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,676 INFO L273 TraceCheckUtils]: 33: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,676 INFO L273 TraceCheckUtils]: 34: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,676 INFO L273 TraceCheckUtils]: 35: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,676 INFO L273 TraceCheckUtils]: 37: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,677 INFO L273 TraceCheckUtils]: 38: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,677 INFO L273 TraceCheckUtils]: 39: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,677 INFO L273 TraceCheckUtils]: 40: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,677 INFO L273 TraceCheckUtils]: 41: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,677 INFO L273 TraceCheckUtils]: 42: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,677 INFO L273 TraceCheckUtils]: 43: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,677 INFO L273 TraceCheckUtils]: 44: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,677 INFO L273 TraceCheckUtils]: 45: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,677 INFO L273 TraceCheckUtils]: 46: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,678 INFO L273 TraceCheckUtils]: 47: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,678 INFO L273 TraceCheckUtils]: 48: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,678 INFO L273 TraceCheckUtils]: 49: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,678 INFO L273 TraceCheckUtils]: 50: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,678 INFO L273 TraceCheckUtils]: 51: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,678 INFO L273 TraceCheckUtils]: 52: Hoare triple {12908#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#true} is VALID [2018-11-23 12:11:26,678 INFO L273 TraceCheckUtils]: 53: Hoare triple {12908#true} assume !(~i~0 < 100000); {12908#true} is VALID [2018-11-23 12:11:26,679 INFO L273 TraceCheckUtils]: 54: Hoare triple {12908#true} ~i~0 := 1; {12911#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:26,679 INFO L273 TraceCheckUtils]: 55: Hoare triple {12911#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12919#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:26,680 INFO L273 TraceCheckUtils]: 56: Hoare triple {12919#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12927#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:26,681 INFO L273 TraceCheckUtils]: 57: Hoare triple {12927#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12935#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:26,681 INFO L273 TraceCheckUtils]: 58: Hoare triple {12935#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12943#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:26,682 INFO L273 TraceCheckUtils]: 59: Hoare triple {12943#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {12951#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:26,683 INFO L273 TraceCheckUtils]: 60: Hoare triple {12951#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13141#(<= main_~i~0 49)} is VALID [2018-11-23 12:11:26,684 INFO L273 TraceCheckUtils]: 61: Hoare triple {13141#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13145#(<= main_~i~0 57)} is VALID [2018-11-23 12:11:26,685 INFO L273 TraceCheckUtils]: 62: Hoare triple {13145#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13149#(<= main_~i~0 65)} is VALID [2018-11-23 12:11:26,686 INFO L273 TraceCheckUtils]: 63: Hoare triple {13149#(<= main_~i~0 65)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13153#(<= main_~i~0 73)} is VALID [2018-11-23 12:11:26,687 INFO L273 TraceCheckUtils]: 64: Hoare triple {13153#(<= main_~i~0 73)} assume !(~i~0 < 100000); {12909#false} is VALID [2018-11-23 12:11:26,687 INFO L273 TraceCheckUtils]: 65: Hoare triple {12909#false} ~i~0 := 1;~j~0 := 0; {12909#false} is VALID [2018-11-23 12:11:26,687 INFO L273 TraceCheckUtils]: 66: Hoare triple {12909#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {12909#false} is VALID [2018-11-23 12:11:26,687 INFO L256 TraceCheckUtils]: 67: Hoare triple {12909#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12909#false} is VALID [2018-11-23 12:11:26,688 INFO L273 TraceCheckUtils]: 68: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2018-11-23 12:11:26,688 INFO L273 TraceCheckUtils]: 69: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2018-11-23 12:11:26,688 INFO L273 TraceCheckUtils]: 70: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2018-11-23 12:11:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-11-23 12:11:26,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:26,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 12] total 54 [2018-11-23 12:11:26,714 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 71 [2018-11-23 12:11:26,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:26,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 12:11:26,778 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:11:26,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 12:11:26,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 12:11:26,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:11:26,781 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 54 states. [2018-11-23 12:11:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:29,341 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2018-11-23 12:11:29,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 12:11:29,341 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 71 [2018-11-23 12:11:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:11:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 142 transitions. [2018-11-23 12:11:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:11:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 142 transitions. [2018-11-23 12:11:29,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 142 transitions. [2018-11-23 12:11:29,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:29,480 INFO L225 Difference]: With dead ends: 132 [2018-11-23 12:11:29,480 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 12:11:29,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:11:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 12:11:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 81. [2018-11-23 12:11:29,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:29,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 81 states. [2018-11-23 12:11:29,544 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 81 states. [2018-11-23 12:11:29,544 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 81 states. [2018-11-23 12:11:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:29,546 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:11:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-11-23 12:11:29,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:29,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:29,547 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 111 states. [2018-11-23 12:11:29,547 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 111 states. [2018-11-23 12:11:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:29,549 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:11:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-11-23 12:11:29,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:29,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:29,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:29,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:11:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-11-23 12:11:29,552 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 71 [2018-11-23 12:11:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:29,552 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-11-23 12:11:29,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 12:11:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-23 12:11:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 12:11:29,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:29,553 INFO L402 BasicCegarLoop]: trace histogram [52, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:29,553 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:29,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:29,554 INFO L82 PathProgramCache]: Analyzing trace with hash -825632122, now seen corresponding path program 28 times [2018-11-23 12:11:29,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:29,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:29,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:29,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:29,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:31,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {13784#true} call ULTIMATE.init(); {13784#true} is VALID [2018-11-23 12:11:31,226 INFO L273 TraceCheckUtils]: 1: Hoare triple {13784#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13784#true} is VALID [2018-11-23 12:11:31,226 INFO L273 TraceCheckUtils]: 2: Hoare triple {13784#true} assume true; {13784#true} is VALID [2018-11-23 12:11:31,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13784#true} {13784#true} #60#return; {13784#true} is VALID [2018-11-23 12:11:31,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {13784#true} call #t~ret4 := main(); {13784#true} is VALID [2018-11-23 12:11:31,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {13784#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {13786#(= main_~i~0 0)} is VALID [2018-11-23 12:11:31,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {13786#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13787#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:31,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {13787#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13788#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:31,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {13788#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13789#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:31,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {13789#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13790#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:31,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {13790#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13791#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:31,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {13791#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13792#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:31,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {13792#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13793#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:31,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {13793#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13794#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:31,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {13794#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13795#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:31,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {13795#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13796#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:31,237 INFO L273 TraceCheckUtils]: 16: Hoare triple {13796#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13797#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:31,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {13797#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13798#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:31,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {13798#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13799#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:31,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {13799#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13800#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:31,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {13800#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13801#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:31,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {13801#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13802#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:31,243 INFO L273 TraceCheckUtils]: 22: Hoare triple {13802#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13803#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:31,244 INFO L273 TraceCheckUtils]: 23: Hoare triple {13803#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13804#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:31,245 INFO L273 TraceCheckUtils]: 24: Hoare triple {13804#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13805#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:31,246 INFO L273 TraceCheckUtils]: 25: Hoare triple {13805#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13806#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:31,247 INFO L273 TraceCheckUtils]: 26: Hoare triple {13806#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13807#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:31,248 INFO L273 TraceCheckUtils]: 27: Hoare triple {13807#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13808#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:31,249 INFO L273 TraceCheckUtils]: 28: Hoare triple {13808#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13809#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:31,250 INFO L273 TraceCheckUtils]: 29: Hoare triple {13809#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13810#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:31,251 INFO L273 TraceCheckUtils]: 30: Hoare triple {13810#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13811#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:31,252 INFO L273 TraceCheckUtils]: 31: Hoare triple {13811#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13812#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:31,253 INFO L273 TraceCheckUtils]: 32: Hoare triple {13812#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13813#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:31,254 INFO L273 TraceCheckUtils]: 33: Hoare triple {13813#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13814#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:31,255 INFO L273 TraceCheckUtils]: 34: Hoare triple {13814#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13815#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:31,256 INFO L273 TraceCheckUtils]: 35: Hoare triple {13815#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13816#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:31,257 INFO L273 TraceCheckUtils]: 36: Hoare triple {13816#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13817#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:31,258 INFO L273 TraceCheckUtils]: 37: Hoare triple {13817#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13818#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:31,259 INFO L273 TraceCheckUtils]: 38: Hoare triple {13818#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13819#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:31,260 INFO L273 TraceCheckUtils]: 39: Hoare triple {13819#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13820#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:31,261 INFO L273 TraceCheckUtils]: 40: Hoare triple {13820#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13821#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:31,262 INFO L273 TraceCheckUtils]: 41: Hoare triple {13821#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13822#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:31,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {13822#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13823#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:31,264 INFO L273 TraceCheckUtils]: 43: Hoare triple {13823#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13824#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:31,265 INFO L273 TraceCheckUtils]: 44: Hoare triple {13824#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13825#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:31,266 INFO L273 TraceCheckUtils]: 45: Hoare triple {13825#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13826#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:31,267 INFO L273 TraceCheckUtils]: 46: Hoare triple {13826#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13827#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:31,268 INFO L273 TraceCheckUtils]: 47: Hoare triple {13827#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13828#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:31,269 INFO L273 TraceCheckUtils]: 48: Hoare triple {13828#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13829#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:31,270 INFO L273 TraceCheckUtils]: 49: Hoare triple {13829#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13830#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:31,271 INFO L273 TraceCheckUtils]: 50: Hoare triple {13830#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13831#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:31,272 INFO L273 TraceCheckUtils]: 51: Hoare triple {13831#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13832#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:31,273 INFO L273 TraceCheckUtils]: 52: Hoare triple {13832#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13833#(<= main_~i~0 47)} is VALID [2018-11-23 12:11:31,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {13833#(<= main_~i~0 47)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13834#(<= main_~i~0 48)} is VALID [2018-11-23 12:11:31,275 INFO L273 TraceCheckUtils]: 54: Hoare triple {13834#(<= main_~i~0 48)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13835#(<= main_~i~0 49)} is VALID [2018-11-23 12:11:31,276 INFO L273 TraceCheckUtils]: 55: Hoare triple {13835#(<= main_~i~0 49)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13836#(<= main_~i~0 50)} is VALID [2018-11-23 12:11:31,277 INFO L273 TraceCheckUtils]: 56: Hoare triple {13836#(<= main_~i~0 50)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13837#(<= main_~i~0 51)} is VALID [2018-11-23 12:11:31,278 INFO L273 TraceCheckUtils]: 57: Hoare triple {13837#(<= main_~i~0 51)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13838#(<= main_~i~0 52)} is VALID [2018-11-23 12:11:31,279 INFO L273 TraceCheckUtils]: 58: Hoare triple {13838#(<= main_~i~0 52)} assume !(~i~0 < 100000); {13785#false} is VALID [2018-11-23 12:11:31,279 INFO L273 TraceCheckUtils]: 59: Hoare triple {13785#false} ~i~0 := 1; {13785#false} is VALID [2018-11-23 12:11:31,279 INFO L273 TraceCheckUtils]: 60: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,280 INFO L273 TraceCheckUtils]: 61: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,280 INFO L273 TraceCheckUtils]: 62: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,280 INFO L273 TraceCheckUtils]: 63: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,280 INFO L273 TraceCheckUtils]: 64: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,281 INFO L273 TraceCheckUtils]: 65: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,281 INFO L273 TraceCheckUtils]: 66: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,281 INFO L273 TraceCheckUtils]: 67: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,281 INFO L273 TraceCheckUtils]: 68: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,281 INFO L273 TraceCheckUtils]: 69: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,282 INFO L273 TraceCheckUtils]: 70: Hoare triple {13785#false} assume !(~i~0 < 100000); {13785#false} is VALID [2018-11-23 12:11:31,282 INFO L273 TraceCheckUtils]: 71: Hoare triple {13785#false} ~i~0 := 1;~j~0 := 0; {13785#false} is VALID [2018-11-23 12:11:31,282 INFO L273 TraceCheckUtils]: 72: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {13785#false} is VALID [2018-11-23 12:11:31,282 INFO L256 TraceCheckUtils]: 73: Hoare triple {13785#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13785#false} is VALID [2018-11-23 12:11:31,282 INFO L273 TraceCheckUtils]: 74: Hoare triple {13785#false} ~cond := #in~cond; {13785#false} is VALID [2018-11-23 12:11:31,282 INFO L273 TraceCheckUtils]: 75: Hoare triple {13785#false} assume 0 == ~cond; {13785#false} is VALID [2018-11-23 12:11:31,282 INFO L273 TraceCheckUtils]: 76: Hoare triple {13785#false} assume !false; {13785#false} is VALID [2018-11-23 12:11:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:11:31,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:31,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:31,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:11:31,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:11:31,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:31,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:31,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {13784#true} call ULTIMATE.init(); {13784#true} is VALID [2018-11-23 12:11:31,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {13784#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13784#true} is VALID [2018-11-23 12:11:31,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {13784#true} assume true; {13784#true} is VALID [2018-11-23 12:11:31,852 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13784#true} {13784#true} #60#return; {13784#true} is VALID [2018-11-23 12:11:31,853 INFO L256 TraceCheckUtils]: 4: Hoare triple {13784#true} call #t~ret4 := main(); {13784#true} is VALID [2018-11-23 12:11:31,853 INFO L273 TraceCheckUtils]: 5: Hoare triple {13784#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {13857#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:31,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {13857#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13787#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:31,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {13787#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13788#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:31,856 INFO L273 TraceCheckUtils]: 8: Hoare triple {13788#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13789#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:31,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {13789#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13790#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:31,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {13790#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13791#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:31,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {13791#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13792#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:31,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {13792#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13793#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:31,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {13793#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13794#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:31,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {13794#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13795#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:31,862 INFO L273 TraceCheckUtils]: 15: Hoare triple {13795#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13796#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:31,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {13796#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13797#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:31,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {13797#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13798#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:31,865 INFO L273 TraceCheckUtils]: 18: Hoare triple {13798#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13799#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:31,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {13799#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13800#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:31,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {13800#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13801#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:31,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {13801#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13802#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:31,869 INFO L273 TraceCheckUtils]: 22: Hoare triple {13802#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13803#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:31,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {13803#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13804#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:31,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {13804#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13805#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:31,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {13805#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13806#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:31,873 INFO L273 TraceCheckUtils]: 26: Hoare triple {13806#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13807#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:31,874 INFO L273 TraceCheckUtils]: 27: Hoare triple {13807#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13808#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:31,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {13808#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13809#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:31,876 INFO L273 TraceCheckUtils]: 29: Hoare triple {13809#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13810#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:31,877 INFO L273 TraceCheckUtils]: 30: Hoare triple {13810#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13811#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:31,878 INFO L273 TraceCheckUtils]: 31: Hoare triple {13811#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13812#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:31,879 INFO L273 TraceCheckUtils]: 32: Hoare triple {13812#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13813#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:31,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {13813#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13814#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:31,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {13814#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13815#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:31,882 INFO L273 TraceCheckUtils]: 35: Hoare triple {13815#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13816#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:31,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {13816#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13817#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:31,884 INFO L273 TraceCheckUtils]: 37: Hoare triple {13817#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13818#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:31,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {13818#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13819#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:31,886 INFO L273 TraceCheckUtils]: 39: Hoare triple {13819#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13820#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:31,887 INFO L273 TraceCheckUtils]: 40: Hoare triple {13820#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13821#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:31,888 INFO L273 TraceCheckUtils]: 41: Hoare triple {13821#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13822#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:31,889 INFO L273 TraceCheckUtils]: 42: Hoare triple {13822#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13823#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:31,890 INFO L273 TraceCheckUtils]: 43: Hoare triple {13823#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13824#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:31,891 INFO L273 TraceCheckUtils]: 44: Hoare triple {13824#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13825#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:31,892 INFO L273 TraceCheckUtils]: 45: Hoare triple {13825#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13826#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:31,893 INFO L273 TraceCheckUtils]: 46: Hoare triple {13826#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13827#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:31,894 INFO L273 TraceCheckUtils]: 47: Hoare triple {13827#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13828#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:31,895 INFO L273 TraceCheckUtils]: 48: Hoare triple {13828#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13829#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:31,896 INFO L273 TraceCheckUtils]: 49: Hoare triple {13829#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13830#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:31,897 INFO L273 TraceCheckUtils]: 50: Hoare triple {13830#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13831#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:31,898 INFO L273 TraceCheckUtils]: 51: Hoare triple {13831#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13832#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:31,899 INFO L273 TraceCheckUtils]: 52: Hoare triple {13832#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13833#(<= main_~i~0 47)} is VALID [2018-11-23 12:11:31,900 INFO L273 TraceCheckUtils]: 53: Hoare triple {13833#(<= main_~i~0 47)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13834#(<= main_~i~0 48)} is VALID [2018-11-23 12:11:31,901 INFO L273 TraceCheckUtils]: 54: Hoare triple {13834#(<= main_~i~0 48)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13835#(<= main_~i~0 49)} is VALID [2018-11-23 12:11:31,902 INFO L273 TraceCheckUtils]: 55: Hoare triple {13835#(<= main_~i~0 49)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13836#(<= main_~i~0 50)} is VALID [2018-11-23 12:11:31,903 INFO L273 TraceCheckUtils]: 56: Hoare triple {13836#(<= main_~i~0 50)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13837#(<= main_~i~0 51)} is VALID [2018-11-23 12:11:31,904 INFO L273 TraceCheckUtils]: 57: Hoare triple {13837#(<= main_~i~0 51)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13838#(<= main_~i~0 52)} is VALID [2018-11-23 12:11:31,905 INFO L273 TraceCheckUtils]: 58: Hoare triple {13838#(<= main_~i~0 52)} assume !(~i~0 < 100000); {13785#false} is VALID [2018-11-23 12:11:31,905 INFO L273 TraceCheckUtils]: 59: Hoare triple {13785#false} ~i~0 := 1; {13785#false} is VALID [2018-11-23 12:11:31,905 INFO L273 TraceCheckUtils]: 60: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,906 INFO L273 TraceCheckUtils]: 61: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,906 INFO L273 TraceCheckUtils]: 62: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,906 INFO L273 TraceCheckUtils]: 63: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,906 INFO L273 TraceCheckUtils]: 64: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,906 INFO L273 TraceCheckUtils]: 65: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,907 INFO L273 TraceCheckUtils]: 66: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,907 INFO L273 TraceCheckUtils]: 67: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,907 INFO L273 TraceCheckUtils]: 68: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,907 INFO L273 TraceCheckUtils]: 69: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {13785#false} is VALID [2018-11-23 12:11:31,907 INFO L273 TraceCheckUtils]: 70: Hoare triple {13785#false} assume !(~i~0 < 100000); {13785#false} is VALID [2018-11-23 12:11:31,907 INFO L273 TraceCheckUtils]: 71: Hoare triple {13785#false} ~i~0 := 1;~j~0 := 0; {13785#false} is VALID [2018-11-23 12:11:31,908 INFO L273 TraceCheckUtils]: 72: Hoare triple {13785#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {13785#false} is VALID [2018-11-23 12:11:31,908 INFO L256 TraceCheckUtils]: 73: Hoare triple {13785#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13785#false} is VALID [2018-11-23 12:11:31,908 INFO L273 TraceCheckUtils]: 74: Hoare triple {13785#false} ~cond := #in~cond; {13785#false} is VALID [2018-11-23 12:11:31,908 INFO L273 TraceCheckUtils]: 75: Hoare triple {13785#false} assume 0 == ~cond; {13785#false} is VALID [2018-11-23 12:11:31,908 INFO L273 TraceCheckUtils]: 76: Hoare triple {13785#false} assume !false; {13785#false} is VALID [2018-11-23 12:11:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:11:31,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:31,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2018-11-23 12:11:31,932 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 77 [2018-11-23 12:11:31,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:31,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2018-11-23 12:11:32,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:32,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-23 12:11:32,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 12:11:32,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 12:11:32,005 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 56 states. [2018-11-23 12:11:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:33,088 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-11-23 12:11:33,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 12:11:33,089 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 77 [2018-11-23 12:11:33,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:11:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 123 transitions. [2018-11-23 12:11:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:11:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 123 transitions. [2018-11-23 12:11:33,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 123 transitions. [2018-11-23 12:11:33,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:33,199 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:11:33,200 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 12:11:33,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 12:11:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 12:11:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-11-23 12:11:33,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:33,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 82 states. [2018-11-23 12:11:33,265 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 82 states. [2018-11-23 12:11:33,266 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 82 states. [2018-11-23 12:11:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:33,268 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-11-23 12:11:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-11-23 12:11:33,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:33,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:33,269 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 103 states. [2018-11-23 12:11:33,269 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 103 states. [2018-11-23 12:11:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:33,271 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-11-23 12:11:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-11-23 12:11:33,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:33,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:33,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:33,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:11:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-23 12:11:33,272 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 77 [2018-11-23 12:11:33,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:33,272 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-23 12:11:33,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-23 12:11:33,273 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-23 12:11:33,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 12:11:33,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:33,273 INFO L402 BasicCegarLoop]: trace histogram [53, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:33,273 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:33,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:33,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1604720726, now seen corresponding path program 29 times [2018-11-23 12:11:33,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:33,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:33,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:33,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:33,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:34,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {14655#true} call ULTIMATE.init(); {14655#true} is VALID [2018-11-23 12:11:34,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {14655#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14655#true} is VALID [2018-11-23 12:11:34,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {14655#true} assume true; {14655#true} is VALID [2018-11-23 12:11:34,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14655#true} {14655#true} #60#return; {14655#true} is VALID [2018-11-23 12:11:34,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {14655#true} call #t~ret4 := main(); {14655#true} is VALID [2018-11-23 12:11:34,975 INFO L273 TraceCheckUtils]: 5: Hoare triple {14655#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {14657#(= main_~i~0 0)} is VALID [2018-11-23 12:11:34,976 INFO L273 TraceCheckUtils]: 6: Hoare triple {14657#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14658#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:34,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {14658#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14659#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:34,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {14659#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14660#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:34,978 INFO L273 TraceCheckUtils]: 9: Hoare triple {14660#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14661#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:34,979 INFO L273 TraceCheckUtils]: 10: Hoare triple {14661#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14662#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:34,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {14662#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14663#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:34,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {14663#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14664#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:34,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {14664#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14665#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:34,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {14665#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14666#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:34,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {14666#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14667#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:34,985 INFO L273 TraceCheckUtils]: 16: Hoare triple {14667#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14668#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:34,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {14668#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14669#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:34,987 INFO L273 TraceCheckUtils]: 18: Hoare triple {14669#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14670#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:34,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {14670#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14671#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:34,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {14671#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14672#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:34,990 INFO L273 TraceCheckUtils]: 21: Hoare triple {14672#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14673#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:34,991 INFO L273 TraceCheckUtils]: 22: Hoare triple {14673#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14674#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:34,992 INFO L273 TraceCheckUtils]: 23: Hoare triple {14674#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14675#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:34,993 INFO L273 TraceCheckUtils]: 24: Hoare triple {14675#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14676#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:34,994 INFO L273 TraceCheckUtils]: 25: Hoare triple {14676#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14677#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:34,995 INFO L273 TraceCheckUtils]: 26: Hoare triple {14677#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14678#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:34,996 INFO L273 TraceCheckUtils]: 27: Hoare triple {14678#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14679#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:34,997 INFO L273 TraceCheckUtils]: 28: Hoare triple {14679#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14680#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:34,998 INFO L273 TraceCheckUtils]: 29: Hoare triple {14680#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14681#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:34,999 INFO L273 TraceCheckUtils]: 30: Hoare triple {14681#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14682#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:35,000 INFO L273 TraceCheckUtils]: 31: Hoare triple {14682#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14683#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:35,001 INFO L273 TraceCheckUtils]: 32: Hoare triple {14683#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14684#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:35,002 INFO L273 TraceCheckUtils]: 33: Hoare triple {14684#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14685#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:35,003 INFO L273 TraceCheckUtils]: 34: Hoare triple {14685#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14686#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:35,004 INFO L273 TraceCheckUtils]: 35: Hoare triple {14686#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14687#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:35,005 INFO L273 TraceCheckUtils]: 36: Hoare triple {14687#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14688#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:35,006 INFO L273 TraceCheckUtils]: 37: Hoare triple {14688#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14689#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:35,007 INFO L273 TraceCheckUtils]: 38: Hoare triple {14689#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14690#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:35,008 INFO L273 TraceCheckUtils]: 39: Hoare triple {14690#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14691#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:35,009 INFO L273 TraceCheckUtils]: 40: Hoare triple {14691#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14692#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:35,010 INFO L273 TraceCheckUtils]: 41: Hoare triple {14692#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14693#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:35,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {14693#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14694#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:35,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {14694#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14695#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:35,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {14695#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14696#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:35,013 INFO L273 TraceCheckUtils]: 45: Hoare triple {14696#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14697#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:35,014 INFO L273 TraceCheckUtils]: 46: Hoare triple {14697#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14698#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:35,015 INFO L273 TraceCheckUtils]: 47: Hoare triple {14698#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14699#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:35,016 INFO L273 TraceCheckUtils]: 48: Hoare triple {14699#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14700#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:35,017 INFO L273 TraceCheckUtils]: 49: Hoare triple {14700#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14701#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:35,018 INFO L273 TraceCheckUtils]: 50: Hoare triple {14701#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14702#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:35,019 INFO L273 TraceCheckUtils]: 51: Hoare triple {14702#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14703#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:35,020 INFO L273 TraceCheckUtils]: 52: Hoare triple {14703#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14704#(<= main_~i~0 47)} is VALID [2018-11-23 12:11:35,021 INFO L273 TraceCheckUtils]: 53: Hoare triple {14704#(<= main_~i~0 47)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14705#(<= main_~i~0 48)} is VALID [2018-11-23 12:11:35,022 INFO L273 TraceCheckUtils]: 54: Hoare triple {14705#(<= main_~i~0 48)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14706#(<= main_~i~0 49)} is VALID [2018-11-23 12:11:35,023 INFO L273 TraceCheckUtils]: 55: Hoare triple {14706#(<= main_~i~0 49)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14707#(<= main_~i~0 50)} is VALID [2018-11-23 12:11:35,024 INFO L273 TraceCheckUtils]: 56: Hoare triple {14707#(<= main_~i~0 50)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14708#(<= main_~i~0 51)} is VALID [2018-11-23 12:11:35,025 INFO L273 TraceCheckUtils]: 57: Hoare triple {14708#(<= main_~i~0 51)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14709#(<= main_~i~0 52)} is VALID [2018-11-23 12:11:35,026 INFO L273 TraceCheckUtils]: 58: Hoare triple {14709#(<= main_~i~0 52)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14710#(<= main_~i~0 53)} is VALID [2018-11-23 12:11:35,026 INFO L273 TraceCheckUtils]: 59: Hoare triple {14710#(<= main_~i~0 53)} assume !(~i~0 < 100000); {14656#false} is VALID [2018-11-23 12:11:35,027 INFO L273 TraceCheckUtils]: 60: Hoare triple {14656#false} ~i~0 := 1; {14656#false} is VALID [2018-11-23 12:11:35,027 INFO L273 TraceCheckUtils]: 61: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:11:35,027 INFO L273 TraceCheckUtils]: 62: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:11:35,027 INFO L273 TraceCheckUtils]: 63: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:11:35,027 INFO L273 TraceCheckUtils]: 64: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:11:35,028 INFO L273 TraceCheckUtils]: 65: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:11:35,028 INFO L273 TraceCheckUtils]: 66: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:11:35,028 INFO L273 TraceCheckUtils]: 67: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:11:35,028 INFO L273 TraceCheckUtils]: 68: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:11:35,028 INFO L273 TraceCheckUtils]: 69: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:11:35,029 INFO L273 TraceCheckUtils]: 70: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:11:35,029 INFO L273 TraceCheckUtils]: 71: Hoare triple {14656#false} assume !(~i~0 < 100000); {14656#false} is VALID [2018-11-23 12:11:35,029 INFO L273 TraceCheckUtils]: 72: Hoare triple {14656#false} ~i~0 := 1;~j~0 := 0; {14656#false} is VALID [2018-11-23 12:11:35,029 INFO L273 TraceCheckUtils]: 73: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {14656#false} is VALID [2018-11-23 12:11:35,029 INFO L256 TraceCheckUtils]: 74: Hoare triple {14656#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {14656#false} is VALID [2018-11-23 12:11:35,029 INFO L273 TraceCheckUtils]: 75: Hoare triple {14656#false} ~cond := #in~cond; {14656#false} is VALID [2018-11-23 12:11:35,030 INFO L273 TraceCheckUtils]: 76: Hoare triple {14656#false} assume 0 == ~cond; {14656#false} is VALID [2018-11-23 12:11:35,030 INFO L273 TraceCheckUtils]: 77: Hoare triple {14656#false} assume !false; {14656#false} is VALID [2018-11-23 12:11:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:11:35,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:35,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:35,043 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:12:27,648 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-11-23 12:12:27,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:27,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:28,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {14655#true} call ULTIMATE.init(); {14655#true} is VALID [2018-11-23 12:12:28,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {14655#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14655#true} is VALID [2018-11-23 12:12:28,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {14655#true} assume true; {14655#true} is VALID [2018-11-23 12:12:28,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14655#true} {14655#true} #60#return; {14655#true} is VALID [2018-11-23 12:12:28,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {14655#true} call #t~ret4 := main(); {14655#true} is VALID [2018-11-23 12:12:28,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {14655#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {14729#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:28,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {14729#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14658#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:28,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {14658#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14659#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:28,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {14659#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14660#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:28,024 INFO L273 TraceCheckUtils]: 9: Hoare triple {14660#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14661#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:28,024 INFO L273 TraceCheckUtils]: 10: Hoare triple {14661#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14662#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:28,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {14662#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14663#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:28,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {14663#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14664#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:28,027 INFO L273 TraceCheckUtils]: 13: Hoare triple {14664#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14665#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:28,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {14665#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14666#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:28,029 INFO L273 TraceCheckUtils]: 15: Hoare triple {14666#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14667#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:28,030 INFO L273 TraceCheckUtils]: 16: Hoare triple {14667#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14668#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:28,031 INFO L273 TraceCheckUtils]: 17: Hoare triple {14668#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14669#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:28,032 INFO L273 TraceCheckUtils]: 18: Hoare triple {14669#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14670#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:28,033 INFO L273 TraceCheckUtils]: 19: Hoare triple {14670#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14671#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:28,034 INFO L273 TraceCheckUtils]: 20: Hoare triple {14671#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14672#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:28,035 INFO L273 TraceCheckUtils]: 21: Hoare triple {14672#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14673#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:28,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {14673#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14674#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:28,037 INFO L273 TraceCheckUtils]: 23: Hoare triple {14674#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14675#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:28,038 INFO L273 TraceCheckUtils]: 24: Hoare triple {14675#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14676#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:28,039 INFO L273 TraceCheckUtils]: 25: Hoare triple {14676#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14677#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:28,040 INFO L273 TraceCheckUtils]: 26: Hoare triple {14677#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14678#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:28,041 INFO L273 TraceCheckUtils]: 27: Hoare triple {14678#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14679#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:28,042 INFO L273 TraceCheckUtils]: 28: Hoare triple {14679#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14680#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:28,043 INFO L273 TraceCheckUtils]: 29: Hoare triple {14680#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14681#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:28,044 INFO L273 TraceCheckUtils]: 30: Hoare triple {14681#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14682#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:28,045 INFO L273 TraceCheckUtils]: 31: Hoare triple {14682#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14683#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:28,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {14683#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14684#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:28,047 INFO L273 TraceCheckUtils]: 33: Hoare triple {14684#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14685#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:28,048 INFO L273 TraceCheckUtils]: 34: Hoare triple {14685#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14686#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:28,050 INFO L273 TraceCheckUtils]: 35: Hoare triple {14686#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14687#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:28,051 INFO L273 TraceCheckUtils]: 36: Hoare triple {14687#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14688#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:28,052 INFO L273 TraceCheckUtils]: 37: Hoare triple {14688#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14689#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:28,053 INFO L273 TraceCheckUtils]: 38: Hoare triple {14689#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14690#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:28,054 INFO L273 TraceCheckUtils]: 39: Hoare triple {14690#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14691#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:28,055 INFO L273 TraceCheckUtils]: 40: Hoare triple {14691#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14692#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:28,056 INFO L273 TraceCheckUtils]: 41: Hoare triple {14692#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14693#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:28,057 INFO L273 TraceCheckUtils]: 42: Hoare triple {14693#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14694#(<= main_~i~0 37)} is VALID [2018-11-23 12:12:28,058 INFO L273 TraceCheckUtils]: 43: Hoare triple {14694#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14695#(<= main_~i~0 38)} is VALID [2018-11-23 12:12:28,059 INFO L273 TraceCheckUtils]: 44: Hoare triple {14695#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14696#(<= main_~i~0 39)} is VALID [2018-11-23 12:12:28,060 INFO L273 TraceCheckUtils]: 45: Hoare triple {14696#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14697#(<= main_~i~0 40)} is VALID [2018-11-23 12:12:28,061 INFO L273 TraceCheckUtils]: 46: Hoare triple {14697#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14698#(<= main_~i~0 41)} is VALID [2018-11-23 12:12:28,062 INFO L273 TraceCheckUtils]: 47: Hoare triple {14698#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14699#(<= main_~i~0 42)} is VALID [2018-11-23 12:12:28,063 INFO L273 TraceCheckUtils]: 48: Hoare triple {14699#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14700#(<= main_~i~0 43)} is VALID [2018-11-23 12:12:28,064 INFO L273 TraceCheckUtils]: 49: Hoare triple {14700#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14701#(<= main_~i~0 44)} is VALID [2018-11-23 12:12:28,065 INFO L273 TraceCheckUtils]: 50: Hoare triple {14701#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14702#(<= main_~i~0 45)} is VALID [2018-11-23 12:12:28,066 INFO L273 TraceCheckUtils]: 51: Hoare triple {14702#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14703#(<= main_~i~0 46)} is VALID [2018-11-23 12:12:28,067 INFO L273 TraceCheckUtils]: 52: Hoare triple {14703#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14704#(<= main_~i~0 47)} is VALID [2018-11-23 12:12:28,068 INFO L273 TraceCheckUtils]: 53: Hoare triple {14704#(<= main_~i~0 47)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14705#(<= main_~i~0 48)} is VALID [2018-11-23 12:12:28,077 INFO L273 TraceCheckUtils]: 54: Hoare triple {14705#(<= main_~i~0 48)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14706#(<= main_~i~0 49)} is VALID [2018-11-23 12:12:28,078 INFO L273 TraceCheckUtils]: 55: Hoare triple {14706#(<= main_~i~0 49)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14707#(<= main_~i~0 50)} is VALID [2018-11-23 12:12:28,079 INFO L273 TraceCheckUtils]: 56: Hoare triple {14707#(<= main_~i~0 50)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14708#(<= main_~i~0 51)} is VALID [2018-11-23 12:12:28,079 INFO L273 TraceCheckUtils]: 57: Hoare triple {14708#(<= main_~i~0 51)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14709#(<= main_~i~0 52)} is VALID [2018-11-23 12:12:28,080 INFO L273 TraceCheckUtils]: 58: Hoare triple {14709#(<= main_~i~0 52)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14710#(<= main_~i~0 53)} is VALID [2018-11-23 12:12:28,080 INFO L273 TraceCheckUtils]: 59: Hoare triple {14710#(<= main_~i~0 53)} assume !(~i~0 < 100000); {14656#false} is VALID [2018-11-23 12:12:28,080 INFO L273 TraceCheckUtils]: 60: Hoare triple {14656#false} ~i~0 := 1; {14656#false} is VALID [2018-11-23 12:12:28,081 INFO L273 TraceCheckUtils]: 61: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:12:28,081 INFO L273 TraceCheckUtils]: 62: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:12:28,081 INFO L273 TraceCheckUtils]: 63: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:12:28,081 INFO L273 TraceCheckUtils]: 64: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:12:28,081 INFO L273 TraceCheckUtils]: 65: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:12:28,082 INFO L273 TraceCheckUtils]: 66: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:12:28,082 INFO L273 TraceCheckUtils]: 67: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:12:28,082 INFO L273 TraceCheckUtils]: 68: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:12:28,082 INFO L273 TraceCheckUtils]: 69: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:12:28,082 INFO L273 TraceCheckUtils]: 70: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {14656#false} is VALID [2018-11-23 12:12:28,083 INFO L273 TraceCheckUtils]: 71: Hoare triple {14656#false} assume !(~i~0 < 100000); {14656#false} is VALID [2018-11-23 12:12:28,083 INFO L273 TraceCheckUtils]: 72: Hoare triple {14656#false} ~i~0 := 1;~j~0 := 0; {14656#false} is VALID [2018-11-23 12:12:28,083 INFO L273 TraceCheckUtils]: 73: Hoare triple {14656#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {14656#false} is VALID [2018-11-23 12:12:28,083 INFO L256 TraceCheckUtils]: 74: Hoare triple {14656#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {14656#false} is VALID [2018-11-23 12:12:28,083 INFO L273 TraceCheckUtils]: 75: Hoare triple {14656#false} ~cond := #in~cond; {14656#false} is VALID [2018-11-23 12:12:28,084 INFO L273 TraceCheckUtils]: 76: Hoare triple {14656#false} assume 0 == ~cond; {14656#false} is VALID [2018-11-23 12:12:28,084 INFO L273 TraceCheckUtils]: 77: Hoare triple {14656#false} assume !false; {14656#false} is VALID [2018-11-23 12:12:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:12:28,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:12:28,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2018-11-23 12:12:28,121 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 78 [2018-11-23 12:12:28,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:28,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2018-11-23 12:12:28,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:28,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-23 12:12:28,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 12:12:28,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:12:28,176 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 57 states. [2018-11-23 12:12:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:29,880 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2018-11-23 12:12:29,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-23 12:12:29,881 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 78 [2018-11-23 12:12:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:12:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 124 transitions. [2018-11-23 12:12:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:12:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 124 transitions. [2018-11-23 12:12:29,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 124 transitions. [2018-11-23 12:12:29,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:30,000 INFO L225 Difference]: With dead ends: 126 [2018-11-23 12:12:30,000 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:12:30,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:12:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:12:30,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2018-11-23 12:12:30,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:30,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 83 states. [2018-11-23 12:12:30,086 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 83 states. [2018-11-23 12:12:30,086 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 83 states. [2018-11-23 12:12:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:30,088 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-11-23 12:12:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-11-23 12:12:30,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:30,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:30,088 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 104 states. [2018-11-23 12:12:30,089 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 104 states. [2018-11-23 12:12:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:30,091 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-11-23 12:12:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-11-23 12:12:30,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:30,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:30,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:30,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 12:12:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-23 12:12:30,093 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 78 [2018-11-23 12:12:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:30,093 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-23 12:12:30,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-23 12:12:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-23 12:12:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 12:12:30,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:30,095 INFO L402 BasicCegarLoop]: trace histogram [54, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:30,095 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:30,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:30,095 INFO L82 PathProgramCache]: Analyzing trace with hash 13336326, now seen corresponding path program 30 times [2018-11-23 12:12:30,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:30,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:30,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:30,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:30,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:31,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {15536#true} call ULTIMATE.init(); {15536#true} is VALID [2018-11-23 12:12:31,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {15536#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15536#true} is VALID [2018-11-23 12:12:31,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {15536#true} assume true; {15536#true} is VALID [2018-11-23 12:12:31,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15536#true} {15536#true} #60#return; {15536#true} is VALID [2018-11-23 12:12:31,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {15536#true} call #t~ret4 := main(); {15536#true} is VALID [2018-11-23 12:12:31,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {15536#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {15538#(= main_~i~0 0)} is VALID [2018-11-23 12:12:31,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {15538#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15539#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:31,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {15539#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15540#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:31,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {15540#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15541#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:31,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {15541#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15542#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:31,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {15542#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15543#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:31,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {15543#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15544#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:31,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {15544#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15545#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:31,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {15545#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15546#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:31,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {15546#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15547#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:31,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {15547#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15548#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:31,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {15548#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15549#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:31,920 INFO L273 TraceCheckUtils]: 17: Hoare triple {15549#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15550#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:31,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {15550#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15551#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:31,932 INFO L273 TraceCheckUtils]: 19: Hoare triple {15551#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15552#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:31,933 INFO L273 TraceCheckUtils]: 20: Hoare triple {15552#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15553#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:31,933 INFO L273 TraceCheckUtils]: 21: Hoare triple {15553#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15554#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:31,934 INFO L273 TraceCheckUtils]: 22: Hoare triple {15554#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15555#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:31,935 INFO L273 TraceCheckUtils]: 23: Hoare triple {15555#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15556#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:31,936 INFO L273 TraceCheckUtils]: 24: Hoare triple {15556#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15557#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:31,937 INFO L273 TraceCheckUtils]: 25: Hoare triple {15557#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15558#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:31,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {15558#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15559#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:31,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {15559#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15560#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:31,940 INFO L273 TraceCheckUtils]: 28: Hoare triple {15560#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15561#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:31,941 INFO L273 TraceCheckUtils]: 29: Hoare triple {15561#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15562#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:31,942 INFO L273 TraceCheckUtils]: 30: Hoare triple {15562#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15563#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:31,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {15563#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15564#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:31,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {15564#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15565#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:31,945 INFO L273 TraceCheckUtils]: 33: Hoare triple {15565#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15566#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:31,946 INFO L273 TraceCheckUtils]: 34: Hoare triple {15566#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15567#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:31,947 INFO L273 TraceCheckUtils]: 35: Hoare triple {15567#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15568#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:31,948 INFO L273 TraceCheckUtils]: 36: Hoare triple {15568#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15569#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:31,949 INFO L273 TraceCheckUtils]: 37: Hoare triple {15569#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15570#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:31,950 INFO L273 TraceCheckUtils]: 38: Hoare triple {15570#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15571#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:31,951 INFO L273 TraceCheckUtils]: 39: Hoare triple {15571#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15572#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:31,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {15572#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15573#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:31,953 INFO L273 TraceCheckUtils]: 41: Hoare triple {15573#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15574#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:31,954 INFO L273 TraceCheckUtils]: 42: Hoare triple {15574#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15575#(<= main_~i~0 37)} is VALID [2018-11-23 12:12:31,955 INFO L273 TraceCheckUtils]: 43: Hoare triple {15575#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15576#(<= main_~i~0 38)} is VALID [2018-11-23 12:12:31,956 INFO L273 TraceCheckUtils]: 44: Hoare triple {15576#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15577#(<= main_~i~0 39)} is VALID [2018-11-23 12:12:31,957 INFO L273 TraceCheckUtils]: 45: Hoare triple {15577#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15578#(<= main_~i~0 40)} is VALID [2018-11-23 12:12:31,960 INFO L273 TraceCheckUtils]: 46: Hoare triple {15578#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15579#(<= main_~i~0 41)} is VALID [2018-11-23 12:12:31,961 INFO L273 TraceCheckUtils]: 47: Hoare triple {15579#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15580#(<= main_~i~0 42)} is VALID [2018-11-23 12:12:31,962 INFO L273 TraceCheckUtils]: 48: Hoare triple {15580#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15581#(<= main_~i~0 43)} is VALID [2018-11-23 12:12:31,962 INFO L273 TraceCheckUtils]: 49: Hoare triple {15581#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15582#(<= main_~i~0 44)} is VALID [2018-11-23 12:12:31,963 INFO L273 TraceCheckUtils]: 50: Hoare triple {15582#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15583#(<= main_~i~0 45)} is VALID [2018-11-23 12:12:31,964 INFO L273 TraceCheckUtils]: 51: Hoare triple {15583#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15584#(<= main_~i~0 46)} is VALID [2018-11-23 12:12:31,964 INFO L273 TraceCheckUtils]: 52: Hoare triple {15584#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15585#(<= main_~i~0 47)} is VALID [2018-11-23 12:12:31,965 INFO L273 TraceCheckUtils]: 53: Hoare triple {15585#(<= main_~i~0 47)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15586#(<= main_~i~0 48)} is VALID [2018-11-23 12:12:31,966 INFO L273 TraceCheckUtils]: 54: Hoare triple {15586#(<= main_~i~0 48)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15587#(<= main_~i~0 49)} is VALID [2018-11-23 12:12:31,967 INFO L273 TraceCheckUtils]: 55: Hoare triple {15587#(<= main_~i~0 49)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15588#(<= main_~i~0 50)} is VALID [2018-11-23 12:12:31,968 INFO L273 TraceCheckUtils]: 56: Hoare triple {15588#(<= main_~i~0 50)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15589#(<= main_~i~0 51)} is VALID [2018-11-23 12:12:31,969 INFO L273 TraceCheckUtils]: 57: Hoare triple {15589#(<= main_~i~0 51)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15590#(<= main_~i~0 52)} is VALID [2018-11-23 12:12:31,970 INFO L273 TraceCheckUtils]: 58: Hoare triple {15590#(<= main_~i~0 52)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15591#(<= main_~i~0 53)} is VALID [2018-11-23 12:12:31,971 INFO L273 TraceCheckUtils]: 59: Hoare triple {15591#(<= main_~i~0 53)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15592#(<= main_~i~0 54)} is VALID [2018-11-23 12:12:31,972 INFO L273 TraceCheckUtils]: 60: Hoare triple {15592#(<= main_~i~0 54)} assume !(~i~0 < 100000); {15537#false} is VALID [2018-11-23 12:12:31,972 INFO L273 TraceCheckUtils]: 61: Hoare triple {15537#false} ~i~0 := 1; {15537#false} is VALID [2018-11-23 12:12:31,972 INFO L273 TraceCheckUtils]: 62: Hoare triple {15537#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15537#false} is VALID [2018-11-23 12:12:31,972 INFO L273 TraceCheckUtils]: 63: Hoare triple {15537#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15537#false} is VALID [2018-11-23 12:12:31,973 INFO L273 TraceCheckUtils]: 64: Hoare triple {15537#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15537#false} is VALID [2018-11-23 12:12:31,973 INFO L273 TraceCheckUtils]: 65: Hoare triple {15537#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15537#false} is VALID [2018-11-23 12:12:31,973 INFO L273 TraceCheckUtils]: 66: Hoare triple {15537#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15537#false} is VALID [2018-11-23 12:12:31,973 INFO L273 TraceCheckUtils]: 67: Hoare triple {15537#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15537#false} is VALID [2018-11-23 12:12:31,973 INFO L273 TraceCheckUtils]: 68: Hoare triple {15537#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15537#false} is VALID [2018-11-23 12:12:31,974 INFO L273 TraceCheckUtils]: 69: Hoare triple {15537#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15537#false} is VALID [2018-11-23 12:12:31,974 INFO L273 TraceCheckUtils]: 70: Hoare triple {15537#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15537#false} is VALID [2018-11-23 12:12:31,974 INFO L273 TraceCheckUtils]: 71: Hoare triple {15537#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15537#false} is VALID [2018-11-23 12:12:31,974 INFO L273 TraceCheckUtils]: 72: Hoare triple {15537#false} assume !(~i~0 < 100000); {15537#false} is VALID [2018-11-23 12:12:31,975 INFO L273 TraceCheckUtils]: 73: Hoare triple {15537#false} ~i~0 := 1;~j~0 := 0; {15537#false} is VALID [2018-11-23 12:12:31,975 INFO L273 TraceCheckUtils]: 74: Hoare triple {15537#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {15537#false} is VALID [2018-11-23 12:12:31,975 INFO L256 TraceCheckUtils]: 75: Hoare triple {15537#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {15537#false} is VALID [2018-11-23 12:12:31,975 INFO L273 TraceCheckUtils]: 76: Hoare triple {15537#false} ~cond := #in~cond; {15537#false} is VALID [2018-11-23 12:12:31,975 INFO L273 TraceCheckUtils]: 77: Hoare triple {15537#false} assume 0 == ~cond; {15537#false} is VALID [2018-11-23 12:12:31,975 INFO L273 TraceCheckUtils]: 78: Hoare triple {15537#false} assume !false; {15537#false} is VALID [2018-11-23 12:12:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:12:31,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:31,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:12:31,991 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:12:39,129 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:12:39,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:39,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:39,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {15536#true} call ULTIMATE.init(); {15536#true} is VALID [2018-11-23 12:12:39,450 INFO L273 TraceCheckUtils]: 1: Hoare triple {15536#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15536#true} is VALID [2018-11-23 12:12:39,450 INFO L273 TraceCheckUtils]: 2: Hoare triple {15536#true} assume true; {15536#true} is VALID [2018-11-23 12:12:39,450 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15536#true} {15536#true} #60#return; {15536#true} is VALID [2018-11-23 12:12:39,451 INFO L256 TraceCheckUtils]: 4: Hoare triple {15536#true} call #t~ret4 := main(); {15536#true} is VALID [2018-11-23 12:12:39,451 INFO L273 TraceCheckUtils]: 5: Hoare triple {15536#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {15536#true} is VALID [2018-11-23 12:12:39,451 INFO L273 TraceCheckUtils]: 6: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,451 INFO L273 TraceCheckUtils]: 7: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,452 INFO L273 TraceCheckUtils]: 9: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,452 INFO L273 TraceCheckUtils]: 10: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,452 INFO L273 TraceCheckUtils]: 11: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,452 INFO L273 TraceCheckUtils]: 12: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,453 INFO L273 TraceCheckUtils]: 14: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,453 INFO L273 TraceCheckUtils]: 15: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,453 INFO L273 TraceCheckUtils]: 16: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,453 INFO L273 TraceCheckUtils]: 17: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,454 INFO L273 TraceCheckUtils]: 22: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,454 INFO L273 TraceCheckUtils]: 23: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,454 INFO L273 TraceCheckUtils]: 24: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,454 INFO L273 TraceCheckUtils]: 25: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,454 INFO L273 TraceCheckUtils]: 26: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,454 INFO L273 TraceCheckUtils]: 27: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,454 INFO L273 TraceCheckUtils]: 28: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,455 INFO L273 TraceCheckUtils]: 29: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,455 INFO L273 TraceCheckUtils]: 30: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,455 INFO L273 TraceCheckUtils]: 31: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,455 INFO L273 TraceCheckUtils]: 32: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,456 INFO L273 TraceCheckUtils]: 38: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,456 INFO L273 TraceCheckUtils]: 39: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,456 INFO L273 TraceCheckUtils]: 40: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,457 INFO L273 TraceCheckUtils]: 41: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,457 INFO L273 TraceCheckUtils]: 42: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,457 INFO L273 TraceCheckUtils]: 43: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,457 INFO L273 TraceCheckUtils]: 44: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,457 INFO L273 TraceCheckUtils]: 45: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,457 INFO L273 TraceCheckUtils]: 46: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,458 INFO L273 TraceCheckUtils]: 47: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,458 INFO L273 TraceCheckUtils]: 48: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,458 INFO L273 TraceCheckUtils]: 49: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,458 INFO L273 TraceCheckUtils]: 50: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,458 INFO L273 TraceCheckUtils]: 51: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,458 INFO L273 TraceCheckUtils]: 52: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,459 INFO L273 TraceCheckUtils]: 53: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,459 INFO L273 TraceCheckUtils]: 54: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,459 INFO L273 TraceCheckUtils]: 55: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,459 INFO L273 TraceCheckUtils]: 56: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,459 INFO L273 TraceCheckUtils]: 57: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,459 INFO L273 TraceCheckUtils]: 58: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,460 INFO L273 TraceCheckUtils]: 59: Hoare triple {15536#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15536#true} is VALID [2018-11-23 12:12:39,460 INFO L273 TraceCheckUtils]: 60: Hoare triple {15536#true} assume !(~i~0 < 100000); {15536#true} is VALID [2018-11-23 12:12:39,460 INFO L273 TraceCheckUtils]: 61: Hoare triple {15536#true} ~i~0 := 1; {15539#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:39,461 INFO L273 TraceCheckUtils]: 62: Hoare triple {15539#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15547#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:39,462 INFO L273 TraceCheckUtils]: 63: Hoare triple {15547#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15555#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:39,462 INFO L273 TraceCheckUtils]: 64: Hoare triple {15555#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15563#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:39,463 INFO L273 TraceCheckUtils]: 65: Hoare triple {15563#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15571#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:39,464 INFO L273 TraceCheckUtils]: 66: Hoare triple {15571#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15579#(<= main_~i~0 41)} is VALID [2018-11-23 12:12:39,465 INFO L273 TraceCheckUtils]: 67: Hoare triple {15579#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15587#(<= main_~i~0 49)} is VALID [2018-11-23 12:12:39,466 INFO L273 TraceCheckUtils]: 68: Hoare triple {15587#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15800#(<= main_~i~0 57)} is VALID [2018-11-23 12:12:39,467 INFO L273 TraceCheckUtils]: 69: Hoare triple {15800#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15804#(<= main_~i~0 65)} is VALID [2018-11-23 12:12:39,468 INFO L273 TraceCheckUtils]: 70: Hoare triple {15804#(<= main_~i~0 65)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15808#(<= main_~i~0 73)} is VALID [2018-11-23 12:12:39,469 INFO L273 TraceCheckUtils]: 71: Hoare triple {15808#(<= main_~i~0 73)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 8 + ~i~0;~j~0 := 1 + ~j~0; {15812#(<= main_~i~0 81)} is VALID [2018-11-23 12:12:39,470 INFO L273 TraceCheckUtils]: 72: Hoare triple {15812#(<= main_~i~0 81)} assume !(~i~0 < 100000); {15537#false} is VALID [2018-11-23 12:12:39,470 INFO L273 TraceCheckUtils]: 73: Hoare triple {15537#false} ~i~0 := 1;~j~0 := 0; {15537#false} is VALID [2018-11-23 12:12:39,471 INFO L273 TraceCheckUtils]: 74: Hoare triple {15537#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 8 * ~j~0), 4); {15537#false} is VALID [2018-11-23 12:12:39,471 INFO L256 TraceCheckUtils]: 75: Hoare triple {15537#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {15537#false} is VALID [2018-11-23 12:12:39,471 INFO L273 TraceCheckUtils]: 76: Hoare triple {15537#false} ~cond := #in~cond; {15537#false} is VALID [2018-11-23 12:12:39,471 INFO L273 TraceCheckUtils]: 77: Hoare triple {15537#false} assume 0 == ~cond; {15537#false} is VALID [2018-11-23 12:12:39,471 INFO L273 TraceCheckUtils]: 78: Hoare triple {15537#false} assume !false; {15537#false} is VALID [2018-11-23 12:12:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-11-23 12:12:39,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:12:39,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 13] total 61 [2018-11-23 12:12:39,500 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 79 [2018-11-23 12:12:39,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:39,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states. [2018-11-23 12:12:39,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:39,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-23 12:12:39,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-23 12:12:39,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 12:12:39,580 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 61 states.