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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_02_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:46:06,241 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:46:06,243 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:46:06,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:46:06,256 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:46:06,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:46:06,258 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:46:06,260 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:46:06,262 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:46:06,262 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:46:06,263 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:46:06,264 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:46:06,265 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:46:06,266 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:46:06,267 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:46:06,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:46:06,269 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:46:06,270 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:46:06,273 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:46:06,274 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:46:06,275 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:46:06,276 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:46:06,279 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:46:06,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:46:06,280 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:46:06,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:46:06,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:46:06,282 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:46:06,283 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:46:06,284 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:46:06,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:46:06,285 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:46:06,286 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:46:06,286 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:46:06,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:46:06,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:46:06,288 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:46:06,303 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:46:06,304 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:46:06,304 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:46:06,305 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:46:06,305 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:46:06,305 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:46:06,306 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:46:06,306 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:46:06,306 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:46:06,306 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:46:06,307 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:46:06,307 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:46:06,307 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:46:06,307 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:46:06,307 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:46:06,308 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:46:06,308 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:46:06,308 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:46:06,308 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:46:06,308 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:46:06,309 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:46:06,309 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:46:06,309 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:46:06,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:46:06,309 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:46:06,310 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:46:06,310 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:46:06,310 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:46:06,310 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:46:06,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:46:06,311 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:46:06,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:46:06,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:46:06,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:46:06,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:46:06,374 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:46:06,374 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_02_true-unreach-call.i [2018-11-14 18:46:06,436 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c34f861/be051115cc654d01a395a6e6e4399c5a/FLAGac53c46bc [2018-11-14 18:46:06,913 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:46:06,914 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_02_true-unreach-call.i [2018-11-14 18:46:06,921 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c34f861/be051115cc654d01a395a6e6e4399c5a/FLAGac53c46bc [2018-11-14 18:46:06,940 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c34f861/be051115cc654d01a395a6e6e4399c5a [2018-11-14 18:46:06,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:46:06,954 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:46:06,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:46:06,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:46:06,960 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:46:06,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:46:06" (1/1) ... [2018-11-14 18:46:06,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd8c054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:06, skipping insertion in model container [2018-11-14 18:46:06,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:46:06" (1/1) ... [2018-11-14 18:46:06,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:46:06,996 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:46:07,243 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:46:07,249 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:46:07,284 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:46:07,309 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:46:07,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:07 WrapperNode [2018-11-14 18:46:07,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:46:07,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:46:07,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:46:07,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:46:07,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:07" (1/1) ... [2018-11-14 18:46:07,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:07" (1/1) ... [2018-11-14 18:46:07,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:07" (1/1) ... [2018-11-14 18:46:07,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:07" (1/1) ... [2018-11-14 18:46:07,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:07" (1/1) ... [2018-11-14 18:46:07,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:07" (1/1) ... [2018-11-14 18:46:07,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:07" (1/1) ... [2018-11-14 18:46:07,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:46:07,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:46:07,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:46:07,358 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:46:07,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:07" (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-14 18:46:07,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:46:07,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:46:07,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:46:07,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:46:07,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:46:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:46:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:46:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:46:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:46:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:46:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:46:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:46:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:46:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:46:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:46:08,029 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:46:08,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:46:08 BoogieIcfgContainer [2018-11-14 18:46:08,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:46:08,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:46:08,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:46:08,035 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:46:08,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:46:06" (1/3) ... [2018-11-14 18:46:08,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c06e8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:46:08, skipping insertion in model container [2018-11-14 18:46:08,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:07" (2/3) ... [2018-11-14 18:46:08,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c06e8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:46:08, skipping insertion in model container [2018-11-14 18:46:08,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:46:08" (3/3) ... [2018-11-14 18:46:08,039 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_02_true-unreach-call.i [2018-11-14 18:46:08,047 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:46:08,054 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:46:08,068 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:46:08,102 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:46:08,102 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:46:08,103 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:46:08,103 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:46:08,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:46:08,103 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:46:08,103 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:46:08,103 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:46:08,104 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:46:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-14 18:46:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:46:08,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:08,130 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:08,132 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:08,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:08,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1015131587, now seen corresponding path program 1 times [2018-11-14 18:46:08,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:08,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:08,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:08,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:08,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:08,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-14 18:46:08,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-14 18:46:08,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-14 18:46:08,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-14 18:46:08,298 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret4 := main(); {30#true} is VALID [2018-11-14 18:46:08,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#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; {30#true} is VALID [2018-11-14 18:46:08,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-14 18:46:08,300 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~i~0 := 1; {31#false} is VALID [2018-11-14 18:46:08,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !true; {31#false} is VALID [2018-11-14 18:46:08,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 1;~j~0 := 0; {31#false} is VALID [2018-11-14 18:46:08,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume true; {31#false} is VALID [2018-11-14 18:46:08,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {31#false} is VALID [2018-11-14 18:46:08,301 INFO L256 TraceCheckUtils]: 12: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {31#false} is VALID [2018-11-14 18:46:08,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-14 18:46:08,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume ~cond == 0; {31#false} is VALID [2018-11-14 18:46:08,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-14 18:46:08,306 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-14 18:46:08,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:46:08,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:46:08,314 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:46:08,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:08,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:46:08,429 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-14 18:46:08,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:46:08,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:46:08,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:46:08,444 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-14 18:46:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:08,743 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-14 18:46:08,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:46:08,743 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:46:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:46:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 18:46:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:46:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 18:46:08,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-14 18:46:08,953 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-14 18:46:08,964 INFO L225 Difference]: With dead ends: 46 [2018-11-14 18:46:08,964 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 18:46:08,968 INFO L604 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-14 18:46:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 18:46:09,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 18:46:09,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:09,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 18:46:09,006 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 18:46:09,006 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 18:46:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:09,010 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 18:46:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 18:46:09,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:09,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:09,011 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 18:46:09,011 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 18:46:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:09,015 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 18:46:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 18:46:09,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:09,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:09,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:09,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:46:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-14 18:46:09,021 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2018-11-14 18:46:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:09,021 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-14 18:46:09,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:46:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 18:46:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:46:09,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:09,023 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:09,023 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:09,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:09,024 INFO L82 PathProgramCache]: Analyzing trace with hash -669754579, now seen corresponding path program 1 times [2018-11-14 18:46:09,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:09,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:09,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:09,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:09,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:09,200 INFO L256 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2018-11-14 18:46:09,200 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {168#true} is VALID [2018-11-14 18:46:09,201 INFO L273 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2018-11-14 18:46:09,201 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #63#return; {168#true} is VALID [2018-11-14 18:46:09,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret4 := main(); {168#true} is VALID [2018-11-14 18:46:09,202 INFO L273 TraceCheckUtils]: 5: Hoare triple {168#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; {170#(= main_~i~0 0)} is VALID [2018-11-14 18:46:09,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {170#(= main_~i~0 0)} assume true; {170#(= main_~i~0 0)} is VALID [2018-11-14 18:46:09,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {170#(= main_~i~0 0)} assume !(~i~0 < 100000); {169#false} is VALID [2018-11-14 18:46:09,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {169#false} ~i~0 := 1; {169#false} is VALID [2018-11-14 18:46:09,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {169#false} assume true; {169#false} is VALID [2018-11-14 18:46:09,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {169#false} assume !(~i~0 < 100000); {169#false} is VALID [2018-11-14 18:46:09,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {169#false} ~i~0 := 1;~j~0 := 0; {169#false} is VALID [2018-11-14 18:46:09,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {169#false} assume true; {169#false} is VALID [2018-11-14 18:46:09,205 INFO L273 TraceCheckUtils]: 13: Hoare triple {169#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {169#false} is VALID [2018-11-14 18:46:09,206 INFO L256 TraceCheckUtils]: 14: Hoare triple {169#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {169#false} is VALID [2018-11-14 18:46:09,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2018-11-14 18:46:09,206 INFO L273 TraceCheckUtils]: 16: Hoare triple {169#false} assume ~cond == 0; {169#false} is VALID [2018-11-14 18:46:09,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {169#false} assume !false; {169#false} is VALID [2018-11-14 18:46:09,209 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-14 18:46:09,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:46:09,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:46:09,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:46:09,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:09,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:46:09,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:09,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:46:09,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:46:09,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:46:09,263 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-14 18:46:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:09,444 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 18:46:09,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:46:09,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:46:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:46:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 18:46:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:46:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 18:46:09,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-14 18:46:09,652 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-14 18:46:09,654 INFO L225 Difference]: With dead ends: 38 [2018-11-14 18:46:09,655 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 18:46:09,656 INFO L604 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-14 18:46:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 18:46:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 18:46:09,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:09,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 18:46:09,798 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 18:46:09,798 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 18:46:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:09,801 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 18:46:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 18:46:09,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:09,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:09,802 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 18:46:09,803 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 18:46:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:09,805 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 18:46:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 18:46:09,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:09,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:09,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:09,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:46:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-14 18:46:09,809 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2018-11-14 18:46:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:09,810 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-14 18:46:09,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:46:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 18:46:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:46:09,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:09,811 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:09,811 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:09,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:09,812 INFO L82 PathProgramCache]: Analyzing trace with hash 619123155, now seen corresponding path program 1 times [2018-11-14 18:46:09,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:09,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:09,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:09,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2018-11-14 18:46:09,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {307#true} is VALID [2018-11-14 18:46:09,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-14 18:46:09,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #63#return; {307#true} is VALID [2018-11-14 18:46:09,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret4 := main(); {307#true} is VALID [2018-11-14 18:46:09,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {307#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; {307#true} is VALID [2018-11-14 18:46:09,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-14 18:46:09,915 INFO L273 TraceCheckUtils]: 7: Hoare triple {307#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {307#true} is VALID [2018-11-14 18:46:09,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-14 18:46:09,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {307#true} assume !(~i~0 < 100000); {307#true} is VALID [2018-11-14 18:46:09,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {307#true} ~i~0 := 1; {309#(= main_~i~0 1)} is VALID [2018-11-14 18:46:09,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {309#(= main_~i~0 1)} assume true; {309#(= main_~i~0 1)} is VALID [2018-11-14 18:46:09,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {309#(= main_~i~0 1)} assume !(~i~0 < 100000); {308#false} is VALID [2018-11-14 18:46:09,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {308#false} ~i~0 := 1;~j~0 := 0; {308#false} is VALID [2018-11-14 18:46:09,925 INFO L273 TraceCheckUtils]: 14: Hoare triple {308#false} assume true; {308#false} is VALID [2018-11-14 18:46:09,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {308#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {308#false} is VALID [2018-11-14 18:46:09,925 INFO L256 TraceCheckUtils]: 16: Hoare triple {308#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {308#false} is VALID [2018-11-14 18:46:09,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2018-11-14 18:46:09,926 INFO L273 TraceCheckUtils]: 18: Hoare triple {308#false} assume ~cond == 0; {308#false} is VALID [2018-11-14 18:46:09,926 INFO L273 TraceCheckUtils]: 19: Hoare triple {308#false} assume !false; {308#false} is VALID [2018-11-14 18:46:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:46:09,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:46:09,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:46:09,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:46:09,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:09,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:46:10,012 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-14 18:46:10,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:46:10,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:46:10,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:46:10,014 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 3 states. [2018-11-14 18:46:10,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:10,174 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-14 18:46:10,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:46:10,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:46:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:46:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 18:46:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:46:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 18:46:10,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-14 18:46:10,280 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-14 18:46:10,283 INFO L225 Difference]: With dead ends: 41 [2018-11-14 18:46:10,283 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 18:46:10,284 INFO L604 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-14 18:46:10,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 18:46:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-14 18:46:10,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:10,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 26 states. [2018-11-14 18:46:10,299 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 26 states. [2018-11-14 18:46:10,299 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 26 states. [2018-11-14 18:46:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:10,303 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 18:46:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 18:46:10,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:10,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:10,305 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 30 states. [2018-11-14 18:46:10,305 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 30 states. [2018-11-14 18:46:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:10,308 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 18:46:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 18:46:10,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:10,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:10,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:10,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:46:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-14 18:46:10,312 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2018-11-14 18:46:10,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:10,312 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-14 18:46:10,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:46:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-14 18:46:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:46:10,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:10,314 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:10,314 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:10,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:10,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1402898029, now seen corresponding path program 1 times [2018-11-14 18:46:10,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:10,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:10,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:10,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:10,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:10,409 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-14 18:46:10,410 INFO L273 TraceCheckUtils]: 1: Hoare triple {466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {466#true} is VALID [2018-11-14 18:46:10,410 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-14 18:46:10,410 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #63#return; {466#true} is VALID [2018-11-14 18:46:10,411 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret4 := main(); {466#true} is VALID [2018-11-14 18:46:10,412 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#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; {468#(= main_~i~0 0)} is VALID [2018-11-14 18:46:10,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {468#(= main_~i~0 0)} assume true; {468#(= main_~i~0 0)} is VALID [2018-11-14 18:46:10,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {468#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {469#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:10,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(<= main_~i~0 1)} assume true; {469#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:10,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {469#(<= main_~i~0 1)} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-14 18:46:10,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#false} ~i~0 := 1; {467#false} is VALID [2018-11-14 18:46:10,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 18:46:10,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {467#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {467#false} is VALID [2018-11-14 18:46:10,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 18:46:10,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {467#false} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-14 18:46:10,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {467#false} ~i~0 := 1;~j~0 := 0; {467#false} is VALID [2018-11-14 18:46:10,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 18:46:10,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {467#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {467#false} is VALID [2018-11-14 18:46:10,426 INFO L256 TraceCheckUtils]: 18: Hoare triple {467#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {467#false} is VALID [2018-11-14 18:46:10,427 INFO L273 TraceCheckUtils]: 19: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2018-11-14 18:46:10,427 INFO L273 TraceCheckUtils]: 20: Hoare triple {467#false} assume ~cond == 0; {467#false} is VALID [2018-11-14 18:46:10,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-14 18:46:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:46:10,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:10,429 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-14 18:46:10,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:10,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:10,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-14 18:46:10,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {466#true} is VALID [2018-11-14 18:46:10,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-14 18:46:10,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #63#return; {466#true} is VALID [2018-11-14 18:46:10,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret4 := main(); {466#true} is VALID [2018-11-14 18:46:10,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#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; {488#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:10,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {488#(<= main_~i~0 0)} assume true; {488#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:10,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {469#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:10,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(<= main_~i~0 1)} assume true; {469#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:10,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {469#(<= main_~i~0 1)} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-14 18:46:10,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#false} ~i~0 := 1; {467#false} is VALID [2018-11-14 18:46:10,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 18:46:10,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {467#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {467#false} is VALID [2018-11-14 18:46:10,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 18:46:10,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {467#false} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-14 18:46:10,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {467#false} ~i~0 := 1;~j~0 := 0; {467#false} is VALID [2018-11-14 18:46:10,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 18:46:10,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {467#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {467#false} is VALID [2018-11-14 18:46:10,684 INFO L256 TraceCheckUtils]: 18: Hoare triple {467#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {467#false} is VALID [2018-11-14 18:46:10,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2018-11-14 18:46:10,684 INFO L273 TraceCheckUtils]: 20: Hoare triple {467#false} assume ~cond == 0; {467#false} is VALID [2018-11-14 18:46:10,684 INFO L273 TraceCheckUtils]: 21: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-14 18:46:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:46:10,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:10,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:46:10,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 18:46:10,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:10,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:46:10,767 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-14 18:46:10,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:46:10,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:46:10,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:46:10,769 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-14 18:46:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:11,181 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 18:46:11,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:46:11,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 18:46:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:46:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-14 18:46:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:46:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-14 18:46:11,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-14 18:46:11,289 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-14 18:46:11,292 INFO L225 Difference]: With dead ends: 48 [2018-11-14 18:46:11,292 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 18:46:11,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-14 18:46:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 18:46:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-11-14 18:46:11,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:11,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2018-11-14 18:46:11,323 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2018-11-14 18:46:11,323 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2018-11-14 18:46:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:11,327 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 18:46:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 18:46:11,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:11,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:11,328 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2018-11-14 18:46:11,328 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2018-11-14 18:46:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:11,337 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 18:46:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 18:46:11,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:11,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:11,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:11,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:46:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-14 18:46:11,342 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2018-11-14 18:46:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:11,342 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-14 18:46:11,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:46:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 18:46:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:46:11,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:11,344 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:11,344 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:11,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:11,345 INFO L82 PathProgramCache]: Analyzing trace with hash -179733997, now seen corresponding path program 2 times [2018-11-14 18:46:11,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:11,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:11,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:11,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:11,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:11,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2018-11-14 18:46:11,501 INFO L273 TraceCheckUtils]: 1: Hoare triple {707#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {707#true} is VALID [2018-11-14 18:46:11,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2018-11-14 18:46:11,502 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #63#return; {707#true} is VALID [2018-11-14 18:46:11,502 INFO L256 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret4 := main(); {707#true} is VALID [2018-11-14 18:46:11,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {707#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; {709#(= main_~i~0 0)} is VALID [2018-11-14 18:46:11,503 INFO L273 TraceCheckUtils]: 6: Hoare triple {709#(= main_~i~0 0)} assume true; {709#(= main_~i~0 0)} is VALID [2018-11-14 18:46:11,504 INFO L273 TraceCheckUtils]: 7: Hoare triple {709#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {710#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:11,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#(<= main_~i~0 1)} assume true; {710#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:11,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {710#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {711#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:11,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#(<= main_~i~0 2)} assume true; {711#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:11,516 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#(<= main_~i~0 2)} assume !(~i~0 < 100000); {708#false} is VALID [2018-11-14 18:46:11,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {708#false} ~i~0 := 1; {708#false} is VALID [2018-11-14 18:46:11,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 18:46:11,516 INFO L273 TraceCheckUtils]: 14: Hoare triple {708#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {708#false} is VALID [2018-11-14 18:46:11,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 18:46:11,517 INFO L273 TraceCheckUtils]: 16: Hoare triple {708#false} assume !(~i~0 < 100000); {708#false} is VALID [2018-11-14 18:46:11,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {708#false} ~i~0 := 1;~j~0 := 0; {708#false} is VALID [2018-11-14 18:46:11,518 INFO L273 TraceCheckUtils]: 18: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 18:46:11,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {708#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {708#false} is VALID [2018-11-14 18:46:11,518 INFO L256 TraceCheckUtils]: 20: Hoare triple {708#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {708#false} is VALID [2018-11-14 18:46:11,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {708#false} ~cond := #in~cond; {708#false} is VALID [2018-11-14 18:46:11,519 INFO L273 TraceCheckUtils]: 22: Hoare triple {708#false} assume ~cond == 0; {708#false} is VALID [2018-11-14 18:46:11,519 INFO L273 TraceCheckUtils]: 23: Hoare triple {708#false} assume !false; {708#false} is VALID [2018-11-14 18:46:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:46:11,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:11,521 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-14 18:46:11,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:46:11,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:46:11,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:11,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:11,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2018-11-14 18:46:11,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {707#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {707#true} is VALID [2018-11-14 18:46:11,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2018-11-14 18:46:11,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #63#return; {707#true} is VALID [2018-11-14 18:46:11,662 INFO L256 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret4 := main(); {707#true} is VALID [2018-11-14 18:46:11,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {707#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; {730#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:11,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {730#(<= main_~i~0 0)} assume true; {730#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:11,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {730#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {710#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:11,668 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#(<= main_~i~0 1)} assume true; {710#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:11,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {710#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {711#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:11,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#(<= main_~i~0 2)} assume true; {711#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:11,671 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#(<= main_~i~0 2)} assume !(~i~0 < 100000); {708#false} is VALID [2018-11-14 18:46:11,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {708#false} ~i~0 := 1; {708#false} is VALID [2018-11-14 18:46:11,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 18:46:11,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {708#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {708#false} is VALID [2018-11-14 18:46:11,672 INFO L273 TraceCheckUtils]: 15: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 18:46:11,673 INFO L273 TraceCheckUtils]: 16: Hoare triple {708#false} assume !(~i~0 < 100000); {708#false} is VALID [2018-11-14 18:46:11,673 INFO L273 TraceCheckUtils]: 17: Hoare triple {708#false} ~i~0 := 1;~j~0 := 0; {708#false} is VALID [2018-11-14 18:46:11,673 INFO L273 TraceCheckUtils]: 18: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 18:46:11,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {708#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {708#false} is VALID [2018-11-14 18:46:11,674 INFO L256 TraceCheckUtils]: 20: Hoare triple {708#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {708#false} is VALID [2018-11-14 18:46:11,674 INFO L273 TraceCheckUtils]: 21: Hoare triple {708#false} ~cond := #in~cond; {708#false} is VALID [2018-11-14 18:46:11,674 INFO L273 TraceCheckUtils]: 22: Hoare triple {708#false} assume ~cond == 0; {708#false} is VALID [2018-11-14 18:46:11,675 INFO L273 TraceCheckUtils]: 23: Hoare triple {708#false} assume !false; {708#false} is VALID [2018-11-14 18:46:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:46:11,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:11,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 18:46:11,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 18:46:11,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:11,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:46:11,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:11,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:46:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:46:11,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:46:11,763 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2018-11-14 18:46:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:11,994 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-14 18:46:11,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:46:11,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 18:46:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:46:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 18:46:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:46:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 18:46:12,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-14 18:46:12,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:12,091 INFO L225 Difference]: With dead ends: 50 [2018-11-14 18:46:12,092 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:46:12,092 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-14 18:46:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:46:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-11-14 18:46:12,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:12,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 30 states. [2018-11-14 18:46:12,107 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 30 states. [2018-11-14 18:46:12,107 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 30 states. [2018-11-14 18:46:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:12,110 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 18:46:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:46:12,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:12,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:12,111 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 34 states. [2018-11-14 18:46:12,112 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 34 states. [2018-11-14 18:46:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:12,114 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 18:46:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:46:12,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:12,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:12,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:12,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:46:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-14 18:46:12,118 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2018-11-14 18:46:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:12,118 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-14 18:46:12,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:46:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-14 18:46:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:46:12,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:12,120 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:12,120 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:12,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:12,121 INFO L82 PathProgramCache]: Analyzing trace with hash -670688199, now seen corresponding path program 3 times [2018-11-14 18:46:12,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:12,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:12,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:12,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:12,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:12,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {965#true} call ULTIMATE.init(); {965#true} is VALID [2018-11-14 18:46:12,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {965#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {965#true} is VALID [2018-11-14 18:46:12,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 18:46:12,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {965#true} {965#true} #63#return; {965#true} is VALID [2018-11-14 18:46:12,252 INFO L256 TraceCheckUtils]: 4: Hoare triple {965#true} call #t~ret4 := main(); {965#true} is VALID [2018-11-14 18:46:12,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {965#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; {967#(= main_~i~0 0)} is VALID [2018-11-14 18:46:12,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {967#(= main_~i~0 0)} assume true; {967#(= main_~i~0 0)} is VALID [2018-11-14 18:46:12,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {967#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {968#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:12,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {968#(<= main_~i~0 1)} assume true; {968#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:12,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {968#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {969#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:12,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {969#(<= main_~i~0 2)} assume true; {969#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:12,259 INFO L273 TraceCheckUtils]: 11: Hoare triple {969#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {970#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:12,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {970#(<= main_~i~0 3)} assume true; {970#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:12,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {970#(<= main_~i~0 3)} assume !(~i~0 < 100000); {966#false} is VALID [2018-11-14 18:46:12,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {966#false} ~i~0 := 1; {966#false} is VALID [2018-11-14 18:46:12,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 18:46:12,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {966#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {966#false} is VALID [2018-11-14 18:46:12,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 18:46:12,262 INFO L273 TraceCheckUtils]: 18: Hoare triple {966#false} assume !(~i~0 < 100000); {966#false} is VALID [2018-11-14 18:46:12,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {966#false} ~i~0 := 1;~j~0 := 0; {966#false} is VALID [2018-11-14 18:46:12,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 18:46:12,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {966#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {966#false} is VALID [2018-11-14 18:46:12,264 INFO L256 TraceCheckUtils]: 22: Hoare triple {966#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {966#false} is VALID [2018-11-14 18:46:12,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {966#false} ~cond := #in~cond; {966#false} is VALID [2018-11-14 18:46:12,265 INFO L273 TraceCheckUtils]: 24: Hoare triple {966#false} assume ~cond == 0; {966#false} is VALID [2018-11-14 18:46:12,265 INFO L273 TraceCheckUtils]: 25: Hoare triple {966#false} assume !false; {966#false} is VALID [2018-11-14 18:46:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:46:12,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:12,267 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-14 18:46:12,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:46:12,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 18:46:12,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:12,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:12,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {965#true} call ULTIMATE.init(); {965#true} is VALID [2018-11-14 18:46:12,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {965#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {965#true} is VALID [2018-11-14 18:46:12,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 18:46:12,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {965#true} {965#true} #63#return; {965#true} is VALID [2018-11-14 18:46:12,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {965#true} call #t~ret4 := main(); {965#true} is VALID [2018-11-14 18:46:12,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {965#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; {965#true} is VALID [2018-11-14 18:46:12,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 18:46:12,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {965#true} is VALID [2018-11-14 18:46:12,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 18:46:12,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {965#true} is VALID [2018-11-14 18:46:12,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 18:46:12,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {965#true} is VALID [2018-11-14 18:46:12,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 18:46:12,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {965#true} assume !(~i~0 < 100000); {965#true} is VALID [2018-11-14 18:46:12,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {965#true} ~i~0 := 1; {968#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:12,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {968#(<= main_~i~0 1)} assume true; {968#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:12,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {968#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {970#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:12,378 INFO L273 TraceCheckUtils]: 17: Hoare triple {970#(<= main_~i~0 3)} assume true; {970#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:12,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {970#(<= main_~i~0 3)} assume !(~i~0 < 100000); {966#false} is VALID [2018-11-14 18:46:12,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {966#false} ~i~0 := 1;~j~0 := 0; {966#false} is VALID [2018-11-14 18:46:12,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 18:46:12,379 INFO L273 TraceCheckUtils]: 21: Hoare triple {966#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {966#false} is VALID [2018-11-14 18:46:12,379 INFO L256 TraceCheckUtils]: 22: Hoare triple {966#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {966#false} is VALID [2018-11-14 18:46:12,380 INFO L273 TraceCheckUtils]: 23: Hoare triple {966#false} ~cond := #in~cond; {966#false} is VALID [2018-11-14 18:46:12,380 INFO L273 TraceCheckUtils]: 24: Hoare triple {966#false} assume ~cond == 0; {966#false} is VALID [2018-11-14 18:46:12,380 INFO L273 TraceCheckUtils]: 25: Hoare triple {966#false} assume !false; {966#false} is VALID [2018-11-14 18:46:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:46:12,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:12,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2018-11-14 18:46:12,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-14 18:46:12,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:12,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:46:12,541 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-14 18:46:12,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:46:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:46:12,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:46:12,542 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 6 states. [2018-11-14 18:46:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:12,771 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-14 18:46:12,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:46:12,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-14 18:46:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:46:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-14 18:46:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:46:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-14 18:46:12,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2018-11-14 18:46:12,923 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-14 18:46:12,925 INFO L225 Difference]: With dead ends: 58 [2018-11-14 18:46:12,926 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:46:12,926 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:46:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:46:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2018-11-14 18:46:12,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:12,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 34 states. [2018-11-14 18:46:12,941 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 34 states. [2018-11-14 18:46:12,941 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 34 states. [2018-11-14 18:46:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:12,944 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 18:46:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 18:46:12,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:12,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:12,945 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 42 states. [2018-11-14 18:46:12,945 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 42 states. [2018-11-14 18:46:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:12,948 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 18:46:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 18:46:12,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:12,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:12,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:12,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:46:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-14 18:46:12,951 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 26 [2018-11-14 18:46:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:12,951 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-14 18:46:12,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:46:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-14 18:46:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:46:12,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:12,952 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:12,953 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:12,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:12,953 INFO L82 PathProgramCache]: Analyzing trace with hash -858280327, now seen corresponding path program 4 times [2018-11-14 18:46:12,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:12,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:12,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:12,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:12,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:13,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {1263#true} call ULTIMATE.init(); {1263#true} is VALID [2018-11-14 18:46:13,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {1263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1263#true} is VALID [2018-11-14 18:46:13,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 18:46:13,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1263#true} #63#return; {1263#true} is VALID [2018-11-14 18:46:13,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {1263#true} call #t~ret4 := main(); {1263#true} is VALID [2018-11-14 18:46:13,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {1263#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; {1265#(= main_~i~0 0)} is VALID [2018-11-14 18:46:13,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {1265#(= main_~i~0 0)} assume true; {1265#(= main_~i~0 0)} is VALID [2018-11-14 18:46:13,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {1265#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1266#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:13,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {1266#(<= main_~i~0 1)} assume true; {1266#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:13,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {1266#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1267#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:13,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {1267#(<= main_~i~0 2)} assume true; {1267#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:13,253 INFO L273 TraceCheckUtils]: 11: Hoare triple {1267#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1268#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:13,254 INFO L273 TraceCheckUtils]: 12: Hoare triple {1268#(<= main_~i~0 3)} assume true; {1268#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:13,255 INFO L273 TraceCheckUtils]: 13: Hoare triple {1268#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1269#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:13,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {1269#(<= main_~i~0 4)} assume true; {1269#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:13,257 INFO L273 TraceCheckUtils]: 15: Hoare triple {1269#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1264#false} is VALID [2018-11-14 18:46:13,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {1264#false} ~i~0 := 1; {1264#false} is VALID [2018-11-14 18:46:13,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 18:46:13,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {1264#false} is VALID [2018-11-14 18:46:13,258 INFO L273 TraceCheckUtils]: 19: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 18:46:13,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {1264#false} is VALID [2018-11-14 18:46:13,259 INFO L273 TraceCheckUtils]: 21: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 18:46:13,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {1264#false} assume !(~i~0 < 100000); {1264#false} is VALID [2018-11-14 18:46:13,260 INFO L273 TraceCheckUtils]: 23: Hoare triple {1264#false} ~i~0 := 1;~j~0 := 0; {1264#false} is VALID [2018-11-14 18:46:13,260 INFO L273 TraceCheckUtils]: 24: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 18:46:13,261 INFO L273 TraceCheckUtils]: 25: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {1264#false} is VALID [2018-11-14 18:46:13,261 INFO L256 TraceCheckUtils]: 26: Hoare triple {1264#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1264#false} is VALID [2018-11-14 18:46:13,261 INFO L273 TraceCheckUtils]: 27: Hoare triple {1264#false} ~cond := #in~cond; {1264#false} is VALID [2018-11-14 18:46:13,261 INFO L273 TraceCheckUtils]: 28: Hoare triple {1264#false} assume ~cond == 0; {1264#false} is VALID [2018-11-14 18:46:13,261 INFO L273 TraceCheckUtils]: 29: Hoare triple {1264#false} assume !false; {1264#false} is VALID [2018-11-14 18:46:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 18:46:13,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:13,263 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-14 18:46:13,272 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:46:13,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:46:13,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:13,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:13,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {1263#true} call ULTIMATE.init(); {1263#true} is VALID [2018-11-14 18:46:13,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {1263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1263#true} is VALID [2018-11-14 18:46:13,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 18:46:13,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1263#true} #63#return; {1263#true} is VALID [2018-11-14 18:46:13,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {1263#true} call #t~ret4 := main(); {1263#true} is VALID [2018-11-14 18:46:13,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {1263#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; {1263#true} is VALID [2018-11-14 18:46:13,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 18:46:13,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {1263#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1263#true} is VALID [2018-11-14 18:46:13,533 INFO L273 TraceCheckUtils]: 8: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 18:46:13,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {1263#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1263#true} is VALID [2018-11-14 18:46:13,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 18:46:13,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {1263#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1263#true} is VALID [2018-11-14 18:46:13,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 18:46:13,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {1263#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1263#true} is VALID [2018-11-14 18:46:13,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {1263#true} assume true; {1263#true} is VALID [2018-11-14 18:46:13,534 INFO L273 TraceCheckUtils]: 15: Hoare triple {1263#true} assume !(~i~0 < 100000); {1263#true} is VALID [2018-11-14 18:46:13,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {1263#true} ~i~0 := 1; {1266#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:13,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {1266#(<= main_~i~0 1)} assume true; {1266#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:13,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {1266#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {1268#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:13,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {1268#(<= main_~i~0 3)} assume true; {1268#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:13,540 INFO L273 TraceCheckUtils]: 20: Hoare triple {1268#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {1333#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:13,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {1333#(<= main_~i~0 5)} assume true; {1333#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:13,543 INFO L273 TraceCheckUtils]: 22: Hoare triple {1333#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1264#false} is VALID [2018-11-14 18:46:13,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {1264#false} ~i~0 := 1;~j~0 := 0; {1264#false} is VALID [2018-11-14 18:46:13,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {1264#false} assume true; {1264#false} is VALID [2018-11-14 18:46:13,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {1264#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {1264#false} is VALID [2018-11-14 18:46:13,544 INFO L256 TraceCheckUtils]: 26: Hoare triple {1264#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1264#false} is VALID [2018-11-14 18:46:13,544 INFO L273 TraceCheckUtils]: 27: Hoare triple {1264#false} ~cond := #in~cond; {1264#false} is VALID [2018-11-14 18:46:13,545 INFO L273 TraceCheckUtils]: 28: Hoare triple {1264#false} assume ~cond == 0; {1264#false} is VALID [2018-11-14 18:46:13,545 INFO L273 TraceCheckUtils]: 29: Hoare triple {1264#false} assume !false; {1264#false} is VALID [2018-11-14 18:46:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:46:13,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:13,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2018-11-14 18:46:13,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-14 18:46:13,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:13,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:46:13,635 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-14 18:46:13,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:46:13,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:46:13,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:46:13,636 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-11-14 18:46:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:14,013 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-14 18:46:14,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:46:14,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-14 18:46:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:46:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2018-11-14 18:46:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:46:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2018-11-14 18:46:14,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 75 transitions. [2018-11-14 18:46:14,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:14,098 INFO L225 Difference]: With dead ends: 70 [2018-11-14 18:46:14,099 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 18:46:14,100 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:46:14,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 18:46:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-11-14 18:46:14,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:14,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 40 states. [2018-11-14 18:46:14,127 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 40 states. [2018-11-14 18:46:14,127 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 40 states. [2018-11-14 18:46:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:14,131 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-14 18:46:14,131 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-14 18:46:14,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:14,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:14,132 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 52 states. [2018-11-14 18:46:14,132 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 52 states. [2018-11-14 18:46:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:14,135 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-14 18:46:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-14 18:46:14,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:14,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:14,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:14,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 18:46:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-14 18:46:14,138 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 30 [2018-11-14 18:46:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:14,138 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-14 18:46:14,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:46:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-14 18:46:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:46:14,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:14,140 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:14,140 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:14,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash -204842913, now seen corresponding path program 5 times [2018-11-14 18:46:14,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:14,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:14,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:14,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:14,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:14,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2018-11-14 18:46:14,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1622#true} is VALID [2018-11-14 18:46:14,400 INFO L273 TraceCheckUtils]: 2: Hoare triple {1622#true} assume true; {1622#true} is VALID [2018-11-14 18:46:14,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1622#true} {1622#true} #63#return; {1622#true} is VALID [2018-11-14 18:46:14,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {1622#true} call #t~ret4 := main(); {1622#true} is VALID [2018-11-14 18:46:14,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {1622#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; {1624#(= main_~i~0 0)} is VALID [2018-11-14 18:46:14,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {1624#(= main_~i~0 0)} assume true; {1624#(= main_~i~0 0)} is VALID [2018-11-14 18:46:14,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {1624#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1625#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:14,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {1625#(<= main_~i~0 1)} assume true; {1625#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:14,421 INFO L273 TraceCheckUtils]: 9: Hoare triple {1625#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1626#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:14,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {1626#(<= main_~i~0 2)} assume true; {1626#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:14,422 INFO L273 TraceCheckUtils]: 11: Hoare triple {1626#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1627#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:14,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {1627#(<= main_~i~0 3)} assume true; {1627#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:14,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {1627#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1628#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:14,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {1628#(<= main_~i~0 4)} assume true; {1628#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:14,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {1628#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1629#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:14,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {1629#(<= main_~i~0 5)} assume true; {1629#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:14,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {1629#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1630#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:14,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {1630#(<= main_~i~0 6)} assume true; {1630#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:14,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {1630#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1623#false} is VALID [2018-11-14 18:46:14,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {1623#false} ~i~0 := 1; {1623#false} is VALID [2018-11-14 18:46:14,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {1623#false} assume true; {1623#false} is VALID [2018-11-14 18:46:14,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {1623#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {1623#false} is VALID [2018-11-14 18:46:14,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {1623#false} assume true; {1623#false} is VALID [2018-11-14 18:46:14,429 INFO L273 TraceCheckUtils]: 24: Hoare triple {1623#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {1623#false} is VALID [2018-11-14 18:46:14,430 INFO L273 TraceCheckUtils]: 25: Hoare triple {1623#false} assume true; {1623#false} is VALID [2018-11-14 18:46:14,430 INFO L273 TraceCheckUtils]: 26: Hoare triple {1623#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {1623#false} is VALID [2018-11-14 18:46:14,431 INFO L273 TraceCheckUtils]: 27: Hoare triple {1623#false} assume true; {1623#false} is VALID [2018-11-14 18:46:14,431 INFO L273 TraceCheckUtils]: 28: Hoare triple {1623#false} assume !(~i~0 < 100000); {1623#false} is VALID [2018-11-14 18:46:14,431 INFO L273 TraceCheckUtils]: 29: Hoare triple {1623#false} ~i~0 := 1;~j~0 := 0; {1623#false} is VALID [2018-11-14 18:46:14,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {1623#false} assume true; {1623#false} is VALID [2018-11-14 18:46:14,431 INFO L273 TraceCheckUtils]: 31: Hoare triple {1623#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {1623#false} is VALID [2018-11-14 18:46:14,432 INFO L256 TraceCheckUtils]: 32: Hoare triple {1623#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1623#false} is VALID [2018-11-14 18:46:14,432 INFO L273 TraceCheckUtils]: 33: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2018-11-14 18:46:14,432 INFO L273 TraceCheckUtils]: 34: Hoare triple {1623#false} assume ~cond == 0; {1623#false} is VALID [2018-11-14 18:46:14,432 INFO L273 TraceCheckUtils]: 35: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2018-11-14 18:46:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:46:14,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:14,434 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-14 18:46:14,445 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:46:14,554 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-14 18:46:14,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:14,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:14,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2018-11-14 18:46:14,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1622#true} is VALID [2018-11-14 18:46:14,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {1622#true} assume true; {1622#true} is VALID [2018-11-14 18:46:14,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1622#true} {1622#true} #63#return; {1622#true} is VALID [2018-11-14 18:46:14,694 INFO L256 TraceCheckUtils]: 4: Hoare triple {1622#true} call #t~ret4 := main(); {1622#true} is VALID [2018-11-14 18:46:14,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {1622#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; {1649#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:14,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {1649#(<= main_~i~0 0)} assume true; {1649#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:14,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {1649#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1625#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:14,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {1625#(<= main_~i~0 1)} assume true; {1625#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:14,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {1625#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1626#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:14,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {1626#(<= main_~i~0 2)} assume true; {1626#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:14,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {1626#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1627#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:14,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {1627#(<= main_~i~0 3)} assume true; {1627#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:14,703 INFO L273 TraceCheckUtils]: 13: Hoare triple {1627#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1628#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:14,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {1628#(<= main_~i~0 4)} assume true; {1628#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:14,704 INFO L273 TraceCheckUtils]: 15: Hoare triple {1628#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1629#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:14,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {1629#(<= main_~i~0 5)} assume true; {1629#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:14,705 INFO L273 TraceCheckUtils]: 17: Hoare triple {1629#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1630#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:14,706 INFO L273 TraceCheckUtils]: 18: Hoare triple {1630#(<= main_~i~0 6)} assume true; {1630#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:14,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {1630#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1623#false} is VALID [2018-11-14 18:46:14,707 INFO L273 TraceCheckUtils]: 20: Hoare triple {1623#false} ~i~0 := 1; {1623#false} is VALID [2018-11-14 18:46:14,707 INFO L273 TraceCheckUtils]: 21: Hoare triple {1623#false} assume true; {1623#false} is VALID [2018-11-14 18:46:14,708 INFO L273 TraceCheckUtils]: 22: Hoare triple {1623#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {1623#false} is VALID [2018-11-14 18:46:14,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {1623#false} assume true; {1623#false} is VALID [2018-11-14 18:46:14,708 INFO L273 TraceCheckUtils]: 24: Hoare triple {1623#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {1623#false} is VALID [2018-11-14 18:46:14,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {1623#false} assume true; {1623#false} is VALID [2018-11-14 18:46:14,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {1623#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {1623#false} is VALID [2018-11-14 18:46:14,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {1623#false} assume true; {1623#false} is VALID [2018-11-14 18:46:14,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {1623#false} assume !(~i~0 < 100000); {1623#false} is VALID [2018-11-14 18:46:14,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {1623#false} ~i~0 := 1;~j~0 := 0; {1623#false} is VALID [2018-11-14 18:46:14,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {1623#false} assume true; {1623#false} is VALID [2018-11-14 18:46:14,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {1623#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {1623#false} is VALID [2018-11-14 18:46:14,711 INFO L256 TraceCheckUtils]: 32: Hoare triple {1623#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1623#false} is VALID [2018-11-14 18:46:14,711 INFO L273 TraceCheckUtils]: 33: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2018-11-14 18:46:14,711 INFO L273 TraceCheckUtils]: 34: Hoare triple {1623#false} assume ~cond == 0; {1623#false} is VALID [2018-11-14 18:46:14,711 INFO L273 TraceCheckUtils]: 35: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2018-11-14 18:46:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:46:14,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:14,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 18:46:14,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-11-14 18:46:14,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:14,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:46:14,773 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-14 18:46:14,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:46:14,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:46:14,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:46:14,774 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 10 states. [2018-11-14 18:46:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:15,310 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-11-14 18:46:15,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:46:15,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-11-14 18:46:15,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:46:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2018-11-14 18:46:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:46:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2018-11-14 18:46:15,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2018-11-14 18:46:15,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:15,413 INFO L225 Difference]: With dead ends: 74 [2018-11-14 18:46:15,413 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 18:46:15,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:46:15,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 18:46:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2018-11-14 18:46:15,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:15,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 42 states. [2018-11-14 18:46:15,437 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 42 states. [2018-11-14 18:46:15,437 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 42 states. [2018-11-14 18:46:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:15,442 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-14 18:46:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-14 18:46:15,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:15,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:15,443 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 54 states. [2018-11-14 18:46:15,443 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 54 states. [2018-11-14 18:46:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:15,446 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-14 18:46:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-14 18:46:15,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:15,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:15,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:15,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:46:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-14 18:46:15,449 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 36 [2018-11-14 18:46:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:15,449 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-14 18:46:15,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:46:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-14 18:46:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 18:46:15,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:15,450 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:15,451 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:15,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:15,451 INFO L82 PathProgramCache]: Analyzing trace with hash -300486267, now seen corresponding path program 6 times [2018-11-14 18:46:15,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:15,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:15,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:15,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:15,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:15,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {2014#true} call ULTIMATE.init(); {2014#true} is VALID [2018-11-14 18:46:15,706 INFO L273 TraceCheckUtils]: 1: Hoare triple {2014#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2014#true} is VALID [2018-11-14 18:46:15,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {2014#true} assume true; {2014#true} is VALID [2018-11-14 18:46:15,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2014#true} {2014#true} #63#return; {2014#true} is VALID [2018-11-14 18:46:15,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {2014#true} call #t~ret4 := main(); {2014#true} is VALID [2018-11-14 18:46:15,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {2014#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; {2016#(= main_~i~0 0)} is VALID [2018-11-14 18:46:15,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {2016#(= main_~i~0 0)} assume true; {2016#(= main_~i~0 0)} is VALID [2018-11-14 18:46:15,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {2016#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2017#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:15,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {2017#(<= main_~i~0 1)} assume true; {2017#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:15,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {2017#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2018#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:15,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {2018#(<= main_~i~0 2)} assume true; {2018#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:15,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {2018#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2019#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:15,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {2019#(<= main_~i~0 3)} assume true; {2019#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:15,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {2019#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2020#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:15,715 INFO L273 TraceCheckUtils]: 14: Hoare triple {2020#(<= main_~i~0 4)} assume true; {2020#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:15,716 INFO L273 TraceCheckUtils]: 15: Hoare triple {2020#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2021#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:15,717 INFO L273 TraceCheckUtils]: 16: Hoare triple {2021#(<= main_~i~0 5)} assume true; {2021#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:15,718 INFO L273 TraceCheckUtils]: 17: Hoare triple {2021#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2022#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:15,719 INFO L273 TraceCheckUtils]: 18: Hoare triple {2022#(<= main_~i~0 6)} assume true; {2022#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:15,727 INFO L273 TraceCheckUtils]: 19: Hoare triple {2022#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2023#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:15,728 INFO L273 TraceCheckUtils]: 20: Hoare triple {2023#(<= main_~i~0 7)} assume true; {2023#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:15,728 INFO L273 TraceCheckUtils]: 21: Hoare triple {2023#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2015#false} is VALID [2018-11-14 18:46:15,729 INFO L273 TraceCheckUtils]: 22: Hoare triple {2015#false} ~i~0 := 1; {2015#false} is VALID [2018-11-14 18:46:15,729 INFO L273 TraceCheckUtils]: 23: Hoare triple {2015#false} assume true; {2015#false} is VALID [2018-11-14 18:46:15,729 INFO L273 TraceCheckUtils]: 24: Hoare triple {2015#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2015#false} is VALID [2018-11-14 18:46:15,729 INFO L273 TraceCheckUtils]: 25: Hoare triple {2015#false} assume true; {2015#false} is VALID [2018-11-14 18:46:15,729 INFO L273 TraceCheckUtils]: 26: Hoare triple {2015#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2015#false} is VALID [2018-11-14 18:46:15,729 INFO L273 TraceCheckUtils]: 27: Hoare triple {2015#false} assume true; {2015#false} is VALID [2018-11-14 18:46:15,730 INFO L273 TraceCheckUtils]: 28: Hoare triple {2015#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2015#false} is VALID [2018-11-14 18:46:15,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {2015#false} assume true; {2015#false} is VALID [2018-11-14 18:46:15,730 INFO L273 TraceCheckUtils]: 30: Hoare triple {2015#false} assume !(~i~0 < 100000); {2015#false} is VALID [2018-11-14 18:46:15,730 INFO L273 TraceCheckUtils]: 31: Hoare triple {2015#false} ~i~0 := 1;~j~0 := 0; {2015#false} is VALID [2018-11-14 18:46:15,730 INFO L273 TraceCheckUtils]: 32: Hoare triple {2015#false} assume true; {2015#false} is VALID [2018-11-14 18:46:15,731 INFO L273 TraceCheckUtils]: 33: Hoare triple {2015#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {2015#false} is VALID [2018-11-14 18:46:15,731 INFO L256 TraceCheckUtils]: 34: Hoare triple {2015#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2015#false} is VALID [2018-11-14 18:46:15,731 INFO L273 TraceCheckUtils]: 35: Hoare triple {2015#false} ~cond := #in~cond; {2015#false} is VALID [2018-11-14 18:46:15,731 INFO L273 TraceCheckUtils]: 36: Hoare triple {2015#false} assume ~cond == 0; {2015#false} is VALID [2018-11-14 18:46:15,731 INFO L273 TraceCheckUtils]: 37: Hoare triple {2015#false} assume !false; {2015#false} is VALID [2018-11-14 18:46:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:46:15,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:15,733 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-14 18:46:15,744 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:46:15,787 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 18:46:15,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:15,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:15,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {2014#true} call ULTIMATE.init(); {2014#true} is VALID [2018-11-14 18:46:15,911 INFO L273 TraceCheckUtils]: 1: Hoare triple {2014#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2014#true} is VALID [2018-11-14 18:46:15,911 INFO L273 TraceCheckUtils]: 2: Hoare triple {2014#true} assume true; {2014#true} is VALID [2018-11-14 18:46:15,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2014#true} {2014#true} #63#return; {2014#true} is VALID [2018-11-14 18:46:15,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {2014#true} call #t~ret4 := main(); {2014#true} is VALID [2018-11-14 18:46:15,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {2014#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; {2014#true} is VALID [2018-11-14 18:46:15,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {2014#true} assume true; {2014#true} is VALID [2018-11-14 18:46:15,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {2014#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2014#true} is VALID [2018-11-14 18:46:15,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {2014#true} assume true; {2014#true} is VALID [2018-11-14 18:46:15,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {2014#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2014#true} is VALID [2018-11-14 18:46:15,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {2014#true} assume true; {2014#true} is VALID [2018-11-14 18:46:15,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {2014#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2014#true} is VALID [2018-11-14 18:46:15,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {2014#true} assume true; {2014#true} is VALID [2018-11-14 18:46:15,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {2014#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2014#true} is VALID [2018-11-14 18:46:15,915 INFO L273 TraceCheckUtils]: 14: Hoare triple {2014#true} assume true; {2014#true} is VALID [2018-11-14 18:46:15,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {2014#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2014#true} is VALID [2018-11-14 18:46:15,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {2014#true} assume true; {2014#true} is VALID [2018-11-14 18:46:15,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {2014#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2014#true} is VALID [2018-11-14 18:46:15,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {2014#true} assume true; {2014#true} is VALID [2018-11-14 18:46:15,916 INFO L273 TraceCheckUtils]: 19: Hoare triple {2014#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2014#true} is VALID [2018-11-14 18:46:15,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {2014#true} assume true; {2014#true} is VALID [2018-11-14 18:46:15,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {2014#true} assume !(~i~0 < 100000); {2014#true} is VALID [2018-11-14 18:46:15,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {2014#true} ~i~0 := 1; {2017#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:15,941 INFO L273 TraceCheckUtils]: 23: Hoare triple {2017#(<= main_~i~0 1)} assume true; {2017#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:15,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {2017#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2019#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:15,964 INFO L273 TraceCheckUtils]: 25: Hoare triple {2019#(<= main_~i~0 3)} assume true; {2019#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:15,976 INFO L273 TraceCheckUtils]: 26: Hoare triple {2019#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2021#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:15,989 INFO L273 TraceCheckUtils]: 27: Hoare triple {2021#(<= main_~i~0 5)} assume true; {2021#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:16,002 INFO L273 TraceCheckUtils]: 28: Hoare triple {2021#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2023#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:16,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {2023#(<= main_~i~0 7)} assume true; {2023#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:16,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {2023#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2015#false} is VALID [2018-11-14 18:46:16,010 INFO L273 TraceCheckUtils]: 31: Hoare triple {2015#false} ~i~0 := 1;~j~0 := 0; {2015#false} is VALID [2018-11-14 18:46:16,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {2015#false} assume true; {2015#false} is VALID [2018-11-14 18:46:16,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {2015#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {2015#false} is VALID [2018-11-14 18:46:16,010 INFO L256 TraceCheckUtils]: 34: Hoare triple {2015#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2015#false} is VALID [2018-11-14 18:46:16,011 INFO L273 TraceCheckUtils]: 35: Hoare triple {2015#false} ~cond := #in~cond; {2015#false} is VALID [2018-11-14 18:46:16,011 INFO L273 TraceCheckUtils]: 36: Hoare triple {2015#false} assume ~cond == 0; {2015#false} is VALID [2018-11-14 18:46:16,011 INFO L273 TraceCheckUtils]: 37: Hoare triple {2015#false} assume !false; {2015#false} is VALID [2018-11-14 18:46:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 18:46:16,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:16,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 10 [2018-11-14 18:46:16,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-11-14 18:46:16,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:16,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:46:16,118 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-14 18:46:16,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:46:16,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:46:16,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:46:16,119 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 10 states. [2018-11-14 18:46:16,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:16,503 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-11-14 18:46:16,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:46:16,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-11-14 18:46:16,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:46:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2018-11-14 18:46:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:46:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2018-11-14 18:46:16,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2018-11-14 18:46:16,622 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-14 18:46:16,624 INFO L225 Difference]: With dead ends: 82 [2018-11-14 18:46:16,624 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 18:46:16,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:46:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 18:46:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-11-14 18:46:16,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:16,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 46 states. [2018-11-14 18:46:16,655 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 46 states. [2018-11-14 18:46:16,655 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 46 states. [2018-11-14 18:46:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:16,659 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-14 18:46:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-11-14 18:46:16,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:16,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:16,660 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 62 states. [2018-11-14 18:46:16,660 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 62 states. [2018-11-14 18:46:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:16,663 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-14 18:46:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-11-14 18:46:16,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:16,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:16,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:16,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 18:46:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-14 18:46:16,666 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 38 [2018-11-14 18:46:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:16,666 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-14 18:46:16,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:46:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 18:46:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 18:46:16,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:16,668 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:16,668 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:16,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash -221980731, now seen corresponding path program 7 times [2018-11-14 18:46:16,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:16,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:16,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:16,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:16,865 INFO L256 TraceCheckUtils]: 0: Hoare triple {2446#true} call ULTIMATE.init(); {2446#true} is VALID [2018-11-14 18:46:16,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {2446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2446#true} is VALID [2018-11-14 18:46:16,866 INFO L273 TraceCheckUtils]: 2: Hoare triple {2446#true} assume true; {2446#true} is VALID [2018-11-14 18:46:16,866 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2446#true} {2446#true} #63#return; {2446#true} is VALID [2018-11-14 18:46:16,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {2446#true} call #t~ret4 := main(); {2446#true} is VALID [2018-11-14 18:46:16,874 INFO L273 TraceCheckUtils]: 5: Hoare triple {2446#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; {2448#(= main_~i~0 0)} is VALID [2018-11-14 18:46:16,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {2448#(= main_~i~0 0)} assume true; {2448#(= main_~i~0 0)} is VALID [2018-11-14 18:46:16,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {2448#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2449#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:16,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {2449#(<= main_~i~0 1)} assume true; {2449#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:16,876 INFO L273 TraceCheckUtils]: 9: Hoare triple {2449#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2450#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:16,876 INFO L273 TraceCheckUtils]: 10: Hoare triple {2450#(<= main_~i~0 2)} assume true; {2450#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:16,877 INFO L273 TraceCheckUtils]: 11: Hoare triple {2450#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2451#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:16,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {2451#(<= main_~i~0 3)} assume true; {2451#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:16,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {2451#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2452#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:16,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {2452#(<= main_~i~0 4)} assume true; {2452#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:16,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {2452#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2453#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:16,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {2453#(<= main_~i~0 5)} assume true; {2453#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:16,882 INFO L273 TraceCheckUtils]: 17: Hoare triple {2453#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2454#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:16,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {2454#(<= main_~i~0 6)} assume true; {2454#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:16,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {2454#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2455#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:16,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {2455#(<= main_~i~0 7)} assume true; {2455#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:16,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {2455#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2456#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:16,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {2456#(<= main_~i~0 8)} assume true; {2456#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:16,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {2456#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2447#false} is VALID [2018-11-14 18:46:16,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {2447#false} ~i~0 := 1; {2447#false} is VALID [2018-11-14 18:46:16,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 18:46:16,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {2447#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2447#false} is VALID [2018-11-14 18:46:16,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 18:46:16,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {2447#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2447#false} is VALID [2018-11-14 18:46:16,889 INFO L273 TraceCheckUtils]: 29: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 18:46:16,889 INFO L273 TraceCheckUtils]: 30: Hoare triple {2447#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2447#false} is VALID [2018-11-14 18:46:16,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 18:46:16,889 INFO L273 TraceCheckUtils]: 32: Hoare triple {2447#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2447#false} is VALID [2018-11-14 18:46:16,890 INFO L273 TraceCheckUtils]: 33: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 18:46:16,890 INFO L273 TraceCheckUtils]: 34: Hoare triple {2447#false} assume !(~i~0 < 100000); {2447#false} is VALID [2018-11-14 18:46:16,890 INFO L273 TraceCheckUtils]: 35: Hoare triple {2447#false} ~i~0 := 1;~j~0 := 0; {2447#false} is VALID [2018-11-14 18:46:16,890 INFO L273 TraceCheckUtils]: 36: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 18:46:16,890 INFO L273 TraceCheckUtils]: 37: Hoare triple {2447#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {2447#false} is VALID [2018-11-14 18:46:16,891 INFO L256 TraceCheckUtils]: 38: Hoare triple {2447#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2447#false} is VALID [2018-11-14 18:46:16,891 INFO L273 TraceCheckUtils]: 39: Hoare triple {2447#false} ~cond := #in~cond; {2447#false} is VALID [2018-11-14 18:46:16,891 INFO L273 TraceCheckUtils]: 40: Hoare triple {2447#false} assume ~cond == 0; {2447#false} is VALID [2018-11-14 18:46:16,891 INFO L273 TraceCheckUtils]: 41: Hoare triple {2447#false} assume !false; {2447#false} is VALID [2018-11-14 18:46:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:46:16,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:16,894 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-14 18:46:16,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:16,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:17,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {2446#true} call ULTIMATE.init(); {2446#true} is VALID [2018-11-14 18:46:17,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {2446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2446#true} is VALID [2018-11-14 18:46:17,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {2446#true} assume true; {2446#true} is VALID [2018-11-14 18:46:17,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2446#true} {2446#true} #63#return; {2446#true} is VALID [2018-11-14 18:46:17,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {2446#true} call #t~ret4 := main(); {2446#true} is VALID [2018-11-14 18:46:17,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {2446#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; {2475#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:17,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {2475#(<= main_~i~0 0)} assume true; {2475#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:17,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {2475#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2449#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:17,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {2449#(<= main_~i~0 1)} assume true; {2449#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:17,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {2449#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2450#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:17,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {2450#(<= main_~i~0 2)} assume true; {2450#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:17,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {2450#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2451#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:17,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {2451#(<= main_~i~0 3)} assume true; {2451#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:17,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {2451#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2452#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:17,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {2452#(<= main_~i~0 4)} assume true; {2452#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:17,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {2452#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2453#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:17,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {2453#(<= main_~i~0 5)} assume true; {2453#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:17,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {2453#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2454#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:17,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {2454#(<= main_~i~0 6)} assume true; {2454#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:17,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {2454#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2455#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:17,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {2455#(<= main_~i~0 7)} assume true; {2455#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:17,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {2455#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2456#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:17,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {2456#(<= main_~i~0 8)} assume true; {2456#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:17,160 INFO L273 TraceCheckUtils]: 23: Hoare triple {2456#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2447#false} is VALID [2018-11-14 18:46:17,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {2447#false} ~i~0 := 1; {2447#false} is VALID [2018-11-14 18:46:17,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 18:46:17,161 INFO L273 TraceCheckUtils]: 26: Hoare triple {2447#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2447#false} is VALID [2018-11-14 18:46:17,161 INFO L273 TraceCheckUtils]: 27: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 18:46:17,162 INFO L273 TraceCheckUtils]: 28: Hoare triple {2447#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2447#false} is VALID [2018-11-14 18:46:17,162 INFO L273 TraceCheckUtils]: 29: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 18:46:17,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {2447#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2447#false} is VALID [2018-11-14 18:46:17,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 18:46:17,163 INFO L273 TraceCheckUtils]: 32: Hoare triple {2447#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2447#false} is VALID [2018-11-14 18:46:17,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 18:46:17,163 INFO L273 TraceCheckUtils]: 34: Hoare triple {2447#false} assume !(~i~0 < 100000); {2447#false} is VALID [2018-11-14 18:46:17,163 INFO L273 TraceCheckUtils]: 35: Hoare triple {2447#false} ~i~0 := 1;~j~0 := 0; {2447#false} is VALID [2018-11-14 18:46:17,164 INFO L273 TraceCheckUtils]: 36: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-14 18:46:17,164 INFO L273 TraceCheckUtils]: 37: Hoare triple {2447#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {2447#false} is VALID [2018-11-14 18:46:17,164 INFO L256 TraceCheckUtils]: 38: Hoare triple {2447#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2447#false} is VALID [2018-11-14 18:46:17,164 INFO L273 TraceCheckUtils]: 39: Hoare triple {2447#false} ~cond := #in~cond; {2447#false} is VALID [2018-11-14 18:46:17,164 INFO L273 TraceCheckUtils]: 40: Hoare triple {2447#false} assume ~cond == 0; {2447#false} is VALID [2018-11-14 18:46:17,165 INFO L273 TraceCheckUtils]: 41: Hoare triple {2447#false} assume !false; {2447#false} is VALID [2018-11-14 18:46:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:46:17,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:17,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 18:46:17,187 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-14 18:46:17,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:17,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:46:17,232 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-14 18:46:17,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:46:17,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:46:17,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:46:17,233 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 12 states. [2018-11-14 18:46:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:17,890 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-11-14 18:46:17,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:46:17,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-14 18:46:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:46:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2018-11-14 18:46:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:46:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2018-11-14 18:46:17,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 86 transitions. [2018-11-14 18:46:17,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:17,999 INFO L225 Difference]: With dead ends: 86 [2018-11-14 18:46:17,999 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 18:46:18,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:46:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 18:46:18,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-11-14 18:46:18,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:18,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 48 states. [2018-11-14 18:46:18,061 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 48 states. [2018-11-14 18:46:18,061 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 48 states. [2018-11-14 18:46:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:18,064 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-14 18:46:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-14 18:46:18,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:18,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:18,065 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 64 states. [2018-11-14 18:46:18,065 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 64 states. [2018-11-14 18:46:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:18,066 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-14 18:46:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-14 18:46:18,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:18,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:18,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:18,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 18:46:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-14 18:46:18,068 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 42 [2018-11-14 18:46:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:18,068 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-14 18:46:18,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:46:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-14 18:46:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 18:46:18,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:18,069 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:18,069 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:18,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:18,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2007465067, now seen corresponding path program 8 times [2018-11-14 18:46:18,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:18,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:18,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:18,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:18,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:18,373 INFO L256 TraceCheckUtils]: 0: Hoare triple {2905#true} call ULTIMATE.init(); {2905#true} is VALID [2018-11-14 18:46:18,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {2905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2905#true} is VALID [2018-11-14 18:46:18,374 INFO L273 TraceCheckUtils]: 2: Hoare triple {2905#true} assume true; {2905#true} is VALID [2018-11-14 18:46:18,374 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2905#true} {2905#true} #63#return; {2905#true} is VALID [2018-11-14 18:46:18,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {2905#true} call #t~ret4 := main(); {2905#true} is VALID [2018-11-14 18:46:18,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {2905#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; {2907#(= main_~i~0 0)} is VALID [2018-11-14 18:46:18,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {2907#(= main_~i~0 0)} assume true; {2907#(= main_~i~0 0)} is VALID [2018-11-14 18:46:18,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {2907#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2908#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:18,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {2908#(<= main_~i~0 1)} assume true; {2908#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:18,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {2908#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2909#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:18,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {2909#(<= main_~i~0 2)} assume true; {2909#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:18,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {2909#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2910#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:18,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {2910#(<= main_~i~0 3)} assume true; {2910#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:18,380 INFO L273 TraceCheckUtils]: 13: Hoare triple {2910#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2911#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:18,381 INFO L273 TraceCheckUtils]: 14: Hoare triple {2911#(<= main_~i~0 4)} assume true; {2911#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:18,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {2911#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2912#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:18,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {2912#(<= main_~i~0 5)} assume true; {2912#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:18,384 INFO L273 TraceCheckUtils]: 17: Hoare triple {2912#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2913#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:18,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {2913#(<= main_~i~0 6)} assume true; {2913#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:18,385 INFO L273 TraceCheckUtils]: 19: Hoare triple {2913#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2914#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:18,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {2914#(<= main_~i~0 7)} assume true; {2914#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:18,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {2914#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2915#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:18,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {2915#(<= main_~i~0 8)} assume true; {2915#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:18,396 INFO L273 TraceCheckUtils]: 23: Hoare triple {2915#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2916#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:18,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {2916#(<= main_~i~0 9)} assume true; {2916#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:18,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {2916#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2906#false} is VALID [2018-11-14 18:46:18,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {2906#false} ~i~0 := 1; {2906#false} is VALID [2018-11-14 18:46:18,397 INFO L273 TraceCheckUtils]: 27: Hoare triple {2906#false} assume true; {2906#false} is VALID [2018-11-14 18:46:18,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {2906#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2906#false} is VALID [2018-11-14 18:46:18,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {2906#false} assume true; {2906#false} is VALID [2018-11-14 18:46:18,397 INFO L273 TraceCheckUtils]: 30: Hoare triple {2906#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2906#false} is VALID [2018-11-14 18:46:18,397 INFO L273 TraceCheckUtils]: 31: Hoare triple {2906#false} assume true; {2906#false} is VALID [2018-11-14 18:46:18,398 INFO L273 TraceCheckUtils]: 32: Hoare triple {2906#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2906#false} is VALID [2018-11-14 18:46:18,398 INFO L273 TraceCheckUtils]: 33: Hoare triple {2906#false} assume true; {2906#false} is VALID [2018-11-14 18:46:18,398 INFO L273 TraceCheckUtils]: 34: Hoare triple {2906#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2906#false} is VALID [2018-11-14 18:46:18,398 INFO L273 TraceCheckUtils]: 35: Hoare triple {2906#false} assume true; {2906#false} is VALID [2018-11-14 18:46:18,398 INFO L273 TraceCheckUtils]: 36: Hoare triple {2906#false} assume !(~i~0 < 100000); {2906#false} is VALID [2018-11-14 18:46:18,398 INFO L273 TraceCheckUtils]: 37: Hoare triple {2906#false} ~i~0 := 1;~j~0 := 0; {2906#false} is VALID [2018-11-14 18:46:18,398 INFO L273 TraceCheckUtils]: 38: Hoare triple {2906#false} assume true; {2906#false} is VALID [2018-11-14 18:46:18,398 INFO L273 TraceCheckUtils]: 39: Hoare triple {2906#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {2906#false} is VALID [2018-11-14 18:46:18,399 INFO L256 TraceCheckUtils]: 40: Hoare triple {2906#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2906#false} is VALID [2018-11-14 18:46:18,399 INFO L273 TraceCheckUtils]: 41: Hoare triple {2906#false} ~cond := #in~cond; {2906#false} is VALID [2018-11-14 18:46:18,399 INFO L273 TraceCheckUtils]: 42: Hoare triple {2906#false} assume ~cond == 0; {2906#false} is VALID [2018-11-14 18:46:18,399 INFO L273 TraceCheckUtils]: 43: Hoare triple {2906#false} assume !false; {2906#false} is VALID [2018-11-14 18:46:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:46:18,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:18,401 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-14 18:46:18,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:46:18,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:46:18,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:18,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:18,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {2905#true} call ULTIMATE.init(); {2905#true} is VALID [2018-11-14 18:46:18,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {2905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2905#true} is VALID [2018-11-14 18:46:18,673 INFO L273 TraceCheckUtils]: 2: Hoare triple {2905#true} assume true; {2905#true} is VALID [2018-11-14 18:46:18,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2905#true} {2905#true} #63#return; {2905#true} is VALID [2018-11-14 18:46:18,673 INFO L256 TraceCheckUtils]: 4: Hoare triple {2905#true} call #t~ret4 := main(); {2905#true} is VALID [2018-11-14 18:46:18,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {2905#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; {2935#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:18,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {2935#(<= main_~i~0 0)} assume true; {2935#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:18,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {2935#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2908#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:18,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {2908#(<= main_~i~0 1)} assume true; {2908#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:18,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {2908#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2909#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:18,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {2909#(<= main_~i~0 2)} assume true; {2909#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:18,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {2909#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2910#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:18,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {2910#(<= main_~i~0 3)} assume true; {2910#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:18,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {2910#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2911#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:18,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {2911#(<= main_~i~0 4)} assume true; {2911#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:18,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {2911#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2912#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:18,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {2912#(<= main_~i~0 5)} assume true; {2912#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:18,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {2912#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2913#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:18,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {2913#(<= main_~i~0 6)} assume true; {2913#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:18,688 INFO L273 TraceCheckUtils]: 19: Hoare triple {2913#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2914#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:18,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {2914#(<= main_~i~0 7)} assume true; {2914#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:18,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {2914#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2915#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:18,693 INFO L273 TraceCheckUtils]: 22: Hoare triple {2915#(<= main_~i~0 8)} assume true; {2915#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:18,694 INFO L273 TraceCheckUtils]: 23: Hoare triple {2915#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2916#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:18,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {2916#(<= main_~i~0 9)} assume true; {2916#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:18,695 INFO L273 TraceCheckUtils]: 25: Hoare triple {2916#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2906#false} is VALID [2018-11-14 18:46:18,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {2906#false} ~i~0 := 1; {2906#false} is VALID [2018-11-14 18:46:18,695 INFO L273 TraceCheckUtils]: 27: Hoare triple {2906#false} assume true; {2906#false} is VALID [2018-11-14 18:46:18,695 INFO L273 TraceCheckUtils]: 28: Hoare triple {2906#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2906#false} is VALID [2018-11-14 18:46:18,696 INFO L273 TraceCheckUtils]: 29: Hoare triple {2906#false} assume true; {2906#false} is VALID [2018-11-14 18:46:18,696 INFO L273 TraceCheckUtils]: 30: Hoare triple {2906#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2906#false} is VALID [2018-11-14 18:46:18,696 INFO L273 TraceCheckUtils]: 31: Hoare triple {2906#false} assume true; {2906#false} is VALID [2018-11-14 18:46:18,696 INFO L273 TraceCheckUtils]: 32: Hoare triple {2906#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2906#false} is VALID [2018-11-14 18:46:18,696 INFO L273 TraceCheckUtils]: 33: Hoare triple {2906#false} assume true; {2906#false} is VALID [2018-11-14 18:46:18,696 INFO L273 TraceCheckUtils]: 34: Hoare triple {2906#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {2906#false} is VALID [2018-11-14 18:46:18,696 INFO L273 TraceCheckUtils]: 35: Hoare triple {2906#false} assume true; {2906#false} is VALID [2018-11-14 18:46:18,697 INFO L273 TraceCheckUtils]: 36: Hoare triple {2906#false} assume !(~i~0 < 100000); {2906#false} is VALID [2018-11-14 18:46:18,697 INFO L273 TraceCheckUtils]: 37: Hoare triple {2906#false} ~i~0 := 1;~j~0 := 0; {2906#false} is VALID [2018-11-14 18:46:18,697 INFO L273 TraceCheckUtils]: 38: Hoare triple {2906#false} assume true; {2906#false} is VALID [2018-11-14 18:46:18,697 INFO L273 TraceCheckUtils]: 39: Hoare triple {2906#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {2906#false} is VALID [2018-11-14 18:46:18,697 INFO L256 TraceCheckUtils]: 40: Hoare triple {2906#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2906#false} is VALID [2018-11-14 18:46:18,697 INFO L273 TraceCheckUtils]: 41: Hoare triple {2906#false} ~cond := #in~cond; {2906#false} is VALID [2018-11-14 18:46:18,697 INFO L273 TraceCheckUtils]: 42: Hoare triple {2906#false} assume ~cond == 0; {2906#false} is VALID [2018-11-14 18:46:18,697 INFO L273 TraceCheckUtils]: 43: Hoare triple {2906#false} assume !false; {2906#false} is VALID [2018-11-14 18:46:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:46:18,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:18,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 18:46:18,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-14 18:46:18,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:18,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:46:18,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:18,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:46:18,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:46:18,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:46:18,795 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2018-11-14 18:46:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:19,261 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-11-14 18:46:19,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:46:19,261 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-14 18:46:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:46:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2018-11-14 18:46:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:46:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2018-11-14 18:46:19,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 96 transitions. [2018-11-14 18:46:19,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:19,359 INFO L225 Difference]: With dead ends: 94 [2018-11-14 18:46:19,359 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 18:46:19,360 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:46:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 18:46:19,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2018-11-14 18:46:19,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:19,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 52 states. [2018-11-14 18:46:19,382 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 52 states. [2018-11-14 18:46:19,382 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 52 states. [2018-11-14 18:46:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:19,384 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-14 18:46:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-14 18:46:19,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:19,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:19,384 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 72 states. [2018-11-14 18:46:19,384 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 72 states. [2018-11-14 18:46:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:19,386 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-14 18:46:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-14 18:46:19,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:19,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:19,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:19,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 18:46:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-11-14 18:46:19,388 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 44 [2018-11-14 18:46:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:19,389 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-14 18:46:19,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:46:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-14 18:46:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 18:46:19,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:19,389 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:19,389 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:19,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1275235499, now seen corresponding path program 9 times [2018-11-14 18:46:19,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:19,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:19,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:19,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:19,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {3405#true} call ULTIMATE.init(); {3405#true} is VALID [2018-11-14 18:46:19,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {3405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3405#true} is VALID [2018-11-14 18:46:19,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:19,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3405#true} {3405#true} #63#return; {3405#true} is VALID [2018-11-14 18:46:19,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {3405#true} call #t~ret4 := main(); {3405#true} is VALID [2018-11-14 18:46:19,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {3405#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; {3407#(= main_~i~0 0)} is VALID [2018-11-14 18:46:19,746 INFO L273 TraceCheckUtils]: 6: Hoare triple {3407#(= main_~i~0 0)} assume true; {3407#(= main_~i~0 0)} is VALID [2018-11-14 18:46:19,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {3407#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3408#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:19,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {3408#(<= main_~i~0 1)} assume true; {3408#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:19,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {3408#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3409#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:19,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {3409#(<= main_~i~0 2)} assume true; {3409#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:19,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {3409#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3410#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:19,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {3410#(<= main_~i~0 3)} assume true; {3410#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:19,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {3410#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3411#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:19,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {3411#(<= main_~i~0 4)} assume true; {3411#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:19,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {3411#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3412#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:19,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {3412#(<= main_~i~0 5)} assume true; {3412#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:19,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {3412#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3413#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:19,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {3413#(<= main_~i~0 6)} assume true; {3413#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:19,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {3413#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3414#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:19,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {3414#(<= main_~i~0 7)} assume true; {3414#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:19,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {3414#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3415#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:19,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {3415#(<= main_~i~0 8)} assume true; {3415#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:19,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {3415#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3416#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:19,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {3416#(<= main_~i~0 9)} assume true; {3416#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:19,761 INFO L273 TraceCheckUtils]: 25: Hoare triple {3416#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3417#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:19,762 INFO L273 TraceCheckUtils]: 26: Hoare triple {3417#(<= main_~i~0 10)} assume true; {3417#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:19,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {3417#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3406#false} is VALID [2018-11-14 18:46:19,763 INFO L273 TraceCheckUtils]: 28: Hoare triple {3406#false} ~i~0 := 1; {3406#false} is VALID [2018-11-14 18:46:19,763 INFO L273 TraceCheckUtils]: 29: Hoare triple {3406#false} assume true; {3406#false} is VALID [2018-11-14 18:46:19,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {3406#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3406#false} is VALID [2018-11-14 18:46:19,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {3406#false} assume true; {3406#false} is VALID [2018-11-14 18:46:19,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {3406#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3406#false} is VALID [2018-11-14 18:46:19,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {3406#false} assume true; {3406#false} is VALID [2018-11-14 18:46:19,764 INFO L273 TraceCheckUtils]: 34: Hoare triple {3406#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3406#false} is VALID [2018-11-14 18:46:19,765 INFO L273 TraceCheckUtils]: 35: Hoare triple {3406#false} assume true; {3406#false} is VALID [2018-11-14 18:46:19,765 INFO L273 TraceCheckUtils]: 36: Hoare triple {3406#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3406#false} is VALID [2018-11-14 18:46:19,765 INFO L273 TraceCheckUtils]: 37: Hoare triple {3406#false} assume true; {3406#false} is VALID [2018-11-14 18:46:19,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {3406#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3406#false} is VALID [2018-11-14 18:46:19,765 INFO L273 TraceCheckUtils]: 39: Hoare triple {3406#false} assume true; {3406#false} is VALID [2018-11-14 18:46:19,766 INFO L273 TraceCheckUtils]: 40: Hoare triple {3406#false} assume !(~i~0 < 100000); {3406#false} is VALID [2018-11-14 18:46:19,766 INFO L273 TraceCheckUtils]: 41: Hoare triple {3406#false} ~i~0 := 1;~j~0 := 0; {3406#false} is VALID [2018-11-14 18:46:19,766 INFO L273 TraceCheckUtils]: 42: Hoare triple {3406#false} assume true; {3406#false} is VALID [2018-11-14 18:46:19,766 INFO L273 TraceCheckUtils]: 43: Hoare triple {3406#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {3406#false} is VALID [2018-11-14 18:46:19,766 INFO L256 TraceCheckUtils]: 44: Hoare triple {3406#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3406#false} is VALID [2018-11-14 18:46:19,766 INFO L273 TraceCheckUtils]: 45: Hoare triple {3406#false} ~cond := #in~cond; {3406#false} is VALID [2018-11-14 18:46:19,766 INFO L273 TraceCheckUtils]: 46: Hoare triple {3406#false} assume ~cond == 0; {3406#false} is VALID [2018-11-14 18:46:19,766 INFO L273 TraceCheckUtils]: 47: Hoare triple {3406#false} assume !false; {3406#false} is VALID [2018-11-14 18:46:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 18:46:19,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:19,768 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-14 18:46:19,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:46:19,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-14 18:46:19,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:19,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:20,061 INFO L256 TraceCheckUtils]: 0: Hoare triple {3405#true} call ULTIMATE.init(); {3405#true} is VALID [2018-11-14 18:46:20,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {3405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3405#true} is VALID [2018-11-14 18:46:20,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:20,062 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3405#true} {3405#true} #63#return; {3405#true} is VALID [2018-11-14 18:46:20,062 INFO L256 TraceCheckUtils]: 4: Hoare triple {3405#true} call #t~ret4 := main(); {3405#true} is VALID [2018-11-14 18:46:20,062 INFO L273 TraceCheckUtils]: 5: Hoare triple {3405#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; {3405#true} is VALID [2018-11-14 18:46:20,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:20,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {3405#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3405#true} is VALID [2018-11-14 18:46:20,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:20,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {3405#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3405#true} is VALID [2018-11-14 18:46:20,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:20,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {3405#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3405#true} is VALID [2018-11-14 18:46:20,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:20,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {3405#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3405#true} is VALID [2018-11-14 18:46:20,063 INFO L273 TraceCheckUtils]: 14: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:20,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {3405#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3405#true} is VALID [2018-11-14 18:46:20,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:20,064 INFO L273 TraceCheckUtils]: 17: Hoare triple {3405#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3405#true} is VALID [2018-11-14 18:46:20,064 INFO L273 TraceCheckUtils]: 18: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:20,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {3405#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3405#true} is VALID [2018-11-14 18:46:20,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:20,065 INFO L273 TraceCheckUtils]: 21: Hoare triple {3405#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3405#true} is VALID [2018-11-14 18:46:20,065 INFO L273 TraceCheckUtils]: 22: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:20,065 INFO L273 TraceCheckUtils]: 23: Hoare triple {3405#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3405#true} is VALID [2018-11-14 18:46:20,065 INFO L273 TraceCheckUtils]: 24: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:20,065 INFO L273 TraceCheckUtils]: 25: Hoare triple {3405#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3405#true} is VALID [2018-11-14 18:46:20,066 INFO L273 TraceCheckUtils]: 26: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-14 18:46:20,066 INFO L273 TraceCheckUtils]: 27: Hoare triple {3405#true} assume !(~i~0 < 100000); {3405#true} is VALID [2018-11-14 18:46:20,077 INFO L273 TraceCheckUtils]: 28: Hoare triple {3405#true} ~i~0 := 1; {3408#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:20,077 INFO L273 TraceCheckUtils]: 29: Hoare triple {3408#(<= main_~i~0 1)} assume true; {3408#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:20,078 INFO L273 TraceCheckUtils]: 30: Hoare triple {3408#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3410#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:20,079 INFO L273 TraceCheckUtils]: 31: Hoare triple {3410#(<= main_~i~0 3)} assume true; {3410#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:20,079 INFO L273 TraceCheckUtils]: 32: Hoare triple {3410#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3412#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:20,080 INFO L273 TraceCheckUtils]: 33: Hoare triple {3412#(<= main_~i~0 5)} assume true; {3412#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:20,080 INFO L273 TraceCheckUtils]: 34: Hoare triple {3412#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3414#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:20,081 INFO L273 TraceCheckUtils]: 35: Hoare triple {3414#(<= main_~i~0 7)} assume true; {3414#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:20,081 INFO L273 TraceCheckUtils]: 36: Hoare triple {3414#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3416#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:20,082 INFO L273 TraceCheckUtils]: 37: Hoare triple {3416#(<= main_~i~0 9)} assume true; {3416#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:20,083 INFO L273 TraceCheckUtils]: 38: Hoare triple {3416#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3535#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:20,084 INFO L273 TraceCheckUtils]: 39: Hoare triple {3535#(<= main_~i~0 11)} assume true; {3535#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:20,084 INFO L273 TraceCheckUtils]: 40: Hoare triple {3535#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3406#false} is VALID [2018-11-14 18:46:20,085 INFO L273 TraceCheckUtils]: 41: Hoare triple {3406#false} ~i~0 := 1;~j~0 := 0; {3406#false} is VALID [2018-11-14 18:46:20,085 INFO L273 TraceCheckUtils]: 42: Hoare triple {3406#false} assume true; {3406#false} is VALID [2018-11-14 18:46:20,085 INFO L273 TraceCheckUtils]: 43: Hoare triple {3406#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {3406#false} is VALID [2018-11-14 18:46:20,085 INFO L256 TraceCheckUtils]: 44: Hoare triple {3406#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3406#false} is VALID [2018-11-14 18:46:20,085 INFO L273 TraceCheckUtils]: 45: Hoare triple {3406#false} ~cond := #in~cond; {3406#false} is VALID [2018-11-14 18:46:20,086 INFO L273 TraceCheckUtils]: 46: Hoare triple {3406#false} assume ~cond == 0; {3406#false} is VALID [2018-11-14 18:46:20,086 INFO L273 TraceCheckUtils]: 47: Hoare triple {3406#false} assume !false; {3406#false} is VALID [2018-11-14 18:46:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-14 18:46:20,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:20,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 14 [2018-11-14 18:46:20,109 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-11-14 18:46:20,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:20,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:46:20,169 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-14 18:46:20,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:46:20,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:46:20,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:46:20,170 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 14 states. [2018-11-14 18:46:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:20,730 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2018-11-14 18:46:20,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:46:20,730 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-11-14 18:46:20,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:46:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 108 transitions. [2018-11-14 18:46:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:46:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 108 transitions. [2018-11-14 18:46:20,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 108 transitions. [2018-11-14 18:46:20,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:20,866 INFO L225 Difference]: With dead ends: 106 [2018-11-14 18:46:20,866 INFO L226 Difference]: Without dead ends: 82 [2018-11-14 18:46:20,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:46:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-14 18:46:20,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2018-11-14 18:46:20,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:20,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 58 states. [2018-11-14 18:46:20,891 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 58 states. [2018-11-14 18:46:20,891 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 58 states. [2018-11-14 18:46:20,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:20,894 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-11-14 18:46:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-11-14 18:46:20,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:20,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:20,895 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 82 states. [2018-11-14 18:46:20,895 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 82 states. [2018-11-14 18:46:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:20,898 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-11-14 18:46:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-11-14 18:46:20,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:20,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:20,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:20,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 18:46:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-14 18:46:20,901 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 48 [2018-11-14 18:46:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:20,901 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-14 18:46:20,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:46:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-14 18:46:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 18:46:20,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:20,902 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:20,902 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:20,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:20,903 INFO L82 PathProgramCache]: Analyzing trace with hash 22468369, now seen corresponding path program 10 times [2018-11-14 18:46:20,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:20,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:20,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:20,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:20,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:21,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {3965#true} call ULTIMATE.init(); {3965#true} is VALID [2018-11-14 18:46:21,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {3965#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3965#true} is VALID [2018-11-14 18:46:21,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3965#true} {3965#true} #63#return; {3965#true} is VALID [2018-11-14 18:46:21,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {3965#true} call #t~ret4 := main(); {3965#true} is VALID [2018-11-14 18:46:21,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {3965#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; {3967#(= main_~i~0 0)} is VALID [2018-11-14 18:46:21,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {3967#(= main_~i~0 0)} assume true; {3967#(= main_~i~0 0)} is VALID [2018-11-14 18:46:21,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {3967#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3968#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:21,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {3968#(<= main_~i~0 1)} assume true; {3968#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:21,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {3968#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3969#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:21,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {3969#(<= main_~i~0 2)} assume true; {3969#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:21,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {3969#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3970#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:21,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {3970#(<= main_~i~0 3)} assume true; {3970#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:21,191 INFO L273 TraceCheckUtils]: 13: Hoare triple {3970#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3971#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:21,195 INFO L273 TraceCheckUtils]: 14: Hoare triple {3971#(<= main_~i~0 4)} assume true; {3971#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:21,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {3971#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3972#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:21,196 INFO L273 TraceCheckUtils]: 16: Hoare triple {3972#(<= main_~i~0 5)} assume true; {3972#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:21,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {3972#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3973#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:21,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {3973#(<= main_~i~0 6)} assume true; {3973#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:21,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {3973#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3974#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:21,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {3974#(<= main_~i~0 7)} assume true; {3974#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:21,200 INFO L273 TraceCheckUtils]: 21: Hoare triple {3974#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3975#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:21,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {3975#(<= main_~i~0 8)} assume true; {3975#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:21,201 INFO L273 TraceCheckUtils]: 23: Hoare triple {3975#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3976#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:21,202 INFO L273 TraceCheckUtils]: 24: Hoare triple {3976#(<= main_~i~0 9)} assume true; {3976#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:21,203 INFO L273 TraceCheckUtils]: 25: Hoare triple {3976#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3977#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:21,203 INFO L273 TraceCheckUtils]: 26: Hoare triple {3977#(<= main_~i~0 10)} assume true; {3977#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:21,204 INFO L273 TraceCheckUtils]: 27: Hoare triple {3977#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3978#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:21,205 INFO L273 TraceCheckUtils]: 28: Hoare triple {3978#(<= main_~i~0 11)} assume true; {3978#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:21,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {3978#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3979#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:21,207 INFO L273 TraceCheckUtils]: 30: Hoare triple {3979#(<= main_~i~0 12)} assume true; {3979#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:21,207 INFO L273 TraceCheckUtils]: 31: Hoare triple {3979#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3966#false} is VALID [2018-11-14 18:46:21,207 INFO L273 TraceCheckUtils]: 32: Hoare triple {3966#false} ~i~0 := 1; {3966#false} is VALID [2018-11-14 18:46:21,208 INFO L273 TraceCheckUtils]: 33: Hoare triple {3966#false} assume true; {3966#false} is VALID [2018-11-14 18:46:21,208 INFO L273 TraceCheckUtils]: 34: Hoare triple {3966#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3966#false} is VALID [2018-11-14 18:46:21,208 INFO L273 TraceCheckUtils]: 35: Hoare triple {3966#false} assume true; {3966#false} is VALID [2018-11-14 18:46:21,208 INFO L273 TraceCheckUtils]: 36: Hoare triple {3966#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3966#false} is VALID [2018-11-14 18:46:21,209 INFO L273 TraceCheckUtils]: 37: Hoare triple {3966#false} assume true; {3966#false} is VALID [2018-11-14 18:46:21,209 INFO L273 TraceCheckUtils]: 38: Hoare triple {3966#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3966#false} is VALID [2018-11-14 18:46:21,209 INFO L273 TraceCheckUtils]: 39: Hoare triple {3966#false} assume true; {3966#false} is VALID [2018-11-14 18:46:21,209 INFO L273 TraceCheckUtils]: 40: Hoare triple {3966#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3966#false} is VALID [2018-11-14 18:46:21,209 INFO L273 TraceCheckUtils]: 41: Hoare triple {3966#false} assume true; {3966#false} is VALID [2018-11-14 18:46:21,210 INFO L273 TraceCheckUtils]: 42: Hoare triple {3966#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3966#false} is VALID [2018-11-14 18:46:21,210 INFO L273 TraceCheckUtils]: 43: Hoare triple {3966#false} assume true; {3966#false} is VALID [2018-11-14 18:46:21,210 INFO L273 TraceCheckUtils]: 44: Hoare triple {3966#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3966#false} is VALID [2018-11-14 18:46:21,210 INFO L273 TraceCheckUtils]: 45: Hoare triple {3966#false} assume true; {3966#false} is VALID [2018-11-14 18:46:21,211 INFO L273 TraceCheckUtils]: 46: Hoare triple {3966#false} assume !(~i~0 < 100000); {3966#false} is VALID [2018-11-14 18:46:21,211 INFO L273 TraceCheckUtils]: 47: Hoare triple {3966#false} ~i~0 := 1;~j~0 := 0; {3966#false} is VALID [2018-11-14 18:46:21,211 INFO L273 TraceCheckUtils]: 48: Hoare triple {3966#false} assume true; {3966#false} is VALID [2018-11-14 18:46:21,211 INFO L273 TraceCheckUtils]: 49: Hoare triple {3966#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {3966#false} is VALID [2018-11-14 18:46:21,211 INFO L256 TraceCheckUtils]: 50: Hoare triple {3966#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3966#false} is VALID [2018-11-14 18:46:21,212 INFO L273 TraceCheckUtils]: 51: Hoare triple {3966#false} ~cond := #in~cond; {3966#false} is VALID [2018-11-14 18:46:21,212 INFO L273 TraceCheckUtils]: 52: Hoare triple {3966#false} assume ~cond == 0; {3966#false} is VALID [2018-11-14 18:46:21,212 INFO L273 TraceCheckUtils]: 53: Hoare triple {3966#false} assume !false; {3966#false} is VALID [2018-11-14 18:46:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-14 18:46:21,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:21,214 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-14 18:46:21,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:46:21,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:46:21,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:21,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:21,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {3965#true} call ULTIMATE.init(); {3965#true} is VALID [2018-11-14 18:46:21,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {3965#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3965#true} is VALID [2018-11-14 18:46:21,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3965#true} {3965#true} #63#return; {3965#true} is VALID [2018-11-14 18:46:21,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {3965#true} call #t~ret4 := main(); {3965#true} is VALID [2018-11-14 18:46:21,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {3965#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; {3965#true} is VALID [2018-11-14 18:46:21,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {3965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3965#true} is VALID [2018-11-14 18:46:21,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {3965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3965#true} is VALID [2018-11-14 18:46:21,471 INFO L273 TraceCheckUtils]: 10: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {3965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3965#true} is VALID [2018-11-14 18:46:21,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {3965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3965#true} is VALID [2018-11-14 18:46:21,471 INFO L273 TraceCheckUtils]: 14: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {3965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3965#true} is VALID [2018-11-14 18:46:21,472 INFO L273 TraceCheckUtils]: 16: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,472 INFO L273 TraceCheckUtils]: 17: Hoare triple {3965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3965#true} is VALID [2018-11-14 18:46:21,472 INFO L273 TraceCheckUtils]: 18: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,472 INFO L273 TraceCheckUtils]: 19: Hoare triple {3965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3965#true} is VALID [2018-11-14 18:46:21,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {3965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3965#true} is VALID [2018-11-14 18:46:21,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {3965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3965#true} is VALID [2018-11-14 18:46:21,473 INFO L273 TraceCheckUtils]: 24: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,473 INFO L273 TraceCheckUtils]: 25: Hoare triple {3965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3965#true} is VALID [2018-11-14 18:46:21,473 INFO L273 TraceCheckUtils]: 26: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,473 INFO L273 TraceCheckUtils]: 27: Hoare triple {3965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3965#true} is VALID [2018-11-14 18:46:21,473 INFO L273 TraceCheckUtils]: 28: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,474 INFO L273 TraceCheckUtils]: 29: Hoare triple {3965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3965#true} is VALID [2018-11-14 18:46:21,474 INFO L273 TraceCheckUtils]: 30: Hoare triple {3965#true} assume true; {3965#true} is VALID [2018-11-14 18:46:21,474 INFO L273 TraceCheckUtils]: 31: Hoare triple {3965#true} assume !(~i~0 < 100000); {3965#true} is VALID [2018-11-14 18:46:21,474 INFO L273 TraceCheckUtils]: 32: Hoare triple {3965#true} ~i~0 := 1; {3968#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:21,475 INFO L273 TraceCheckUtils]: 33: Hoare triple {3968#(<= main_~i~0 1)} assume true; {3968#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:21,476 INFO L273 TraceCheckUtils]: 34: Hoare triple {3968#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3970#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:21,476 INFO L273 TraceCheckUtils]: 35: Hoare triple {3970#(<= main_~i~0 3)} assume true; {3970#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:21,477 INFO L273 TraceCheckUtils]: 36: Hoare triple {3970#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3972#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:21,477 INFO L273 TraceCheckUtils]: 37: Hoare triple {3972#(<= main_~i~0 5)} assume true; {3972#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:21,478 INFO L273 TraceCheckUtils]: 38: Hoare triple {3972#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3974#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:21,478 INFO L273 TraceCheckUtils]: 39: Hoare triple {3974#(<= main_~i~0 7)} assume true; {3974#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:21,479 INFO L273 TraceCheckUtils]: 40: Hoare triple {3974#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3976#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:21,480 INFO L273 TraceCheckUtils]: 41: Hoare triple {3976#(<= main_~i~0 9)} assume true; {3976#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:21,481 INFO L273 TraceCheckUtils]: 42: Hoare triple {3976#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {3978#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:21,482 INFO L273 TraceCheckUtils]: 43: Hoare triple {3978#(<= main_~i~0 11)} assume true; {3978#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:21,483 INFO L273 TraceCheckUtils]: 44: Hoare triple {3978#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4115#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:21,483 INFO L273 TraceCheckUtils]: 45: Hoare triple {4115#(<= main_~i~0 13)} assume true; {4115#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:21,484 INFO L273 TraceCheckUtils]: 46: Hoare triple {4115#(<= main_~i~0 13)} assume !(~i~0 < 100000); {3966#false} is VALID [2018-11-14 18:46:21,485 INFO L273 TraceCheckUtils]: 47: Hoare triple {3966#false} ~i~0 := 1;~j~0 := 0; {3966#false} is VALID [2018-11-14 18:46:21,485 INFO L273 TraceCheckUtils]: 48: Hoare triple {3966#false} assume true; {3966#false} is VALID [2018-11-14 18:46:21,485 INFO L273 TraceCheckUtils]: 49: Hoare triple {3966#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {3966#false} is VALID [2018-11-14 18:46:21,486 INFO L256 TraceCheckUtils]: 50: Hoare triple {3966#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3966#false} is VALID [2018-11-14 18:46:21,486 INFO L273 TraceCheckUtils]: 51: Hoare triple {3966#false} ~cond := #in~cond; {3966#false} is VALID [2018-11-14 18:46:21,486 INFO L273 TraceCheckUtils]: 52: Hoare triple {3966#false} assume ~cond == 0; {3966#false} is VALID [2018-11-14 18:46:21,487 INFO L273 TraceCheckUtils]: 53: Hoare triple {3966#false} assume !false; {3966#false} is VALID [2018-11-14 18:46:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-14 18:46:21,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:21,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 16 [2018-11-14 18:46:21,515 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-11-14 18:46:21,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:21,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:46:21,578 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-14 18:46:21,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:46:21,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:46:21,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:46:21,579 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 16 states. [2018-11-14 18:46:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:22,204 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-11-14 18:46:22,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:46:22,205 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-11-14 18:46:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:46:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 119 transitions. [2018-11-14 18:46:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:46:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 119 transitions. [2018-11-14 18:46:22,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 119 transitions. [2018-11-14 18:46:22,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:22,846 INFO L225 Difference]: With dead ends: 118 [2018-11-14 18:46:22,846 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 18:46:22,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:46:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 18:46:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-11-14 18:46:22,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:22,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 64 states. [2018-11-14 18:46:22,999 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 64 states. [2018-11-14 18:46:22,999 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 64 states. [2018-11-14 18:46:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:23,002 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2018-11-14 18:46:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-14 18:46:23,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:23,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:23,003 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 92 states. [2018-11-14 18:46:23,004 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 92 states. [2018-11-14 18:46:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:23,006 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2018-11-14 18:46:23,007 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-14 18:46:23,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:23,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:23,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:23,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 18:46:23,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-11-14 18:46:23,009 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 54 [2018-11-14 18:46:23,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:23,009 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-11-14 18:46:23,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:46:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-14 18:46:23,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-14 18:46:23,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:23,010 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:23,011 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:23,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:23,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1708321033, now seen corresponding path program 11 times [2018-11-14 18:46:23,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:23,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:23,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:23,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:23,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:23,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {4592#true} call ULTIMATE.init(); {4592#true} is VALID [2018-11-14 18:46:23,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {4592#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4592#true} is VALID [2018-11-14 18:46:23,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {4592#true} assume true; {4592#true} is VALID [2018-11-14 18:46:23,834 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4592#true} {4592#true} #63#return; {4592#true} is VALID [2018-11-14 18:46:23,834 INFO L256 TraceCheckUtils]: 4: Hoare triple {4592#true} call #t~ret4 := main(); {4592#true} is VALID [2018-11-14 18:46:23,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {4592#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; {4594#(= main_~i~0 0)} is VALID [2018-11-14 18:46:23,867 INFO L273 TraceCheckUtils]: 6: Hoare triple {4594#(= main_~i~0 0)} assume true; {4594#(= main_~i~0 0)} is VALID [2018-11-14 18:46:23,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {4594#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4595#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:23,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {4595#(<= main_~i~0 1)} assume true; {4595#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:23,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {4595#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4596#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:23,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {4596#(<= main_~i~0 2)} assume true; {4596#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:23,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {4596#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4597#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:23,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {4597#(<= main_~i~0 3)} assume true; {4597#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:23,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {4597#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4598#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:23,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {4598#(<= main_~i~0 4)} assume true; {4598#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:23,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {4598#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4599#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:23,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {4599#(<= main_~i~0 5)} assume true; {4599#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:23,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {4599#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4600#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:23,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {4600#(<= main_~i~0 6)} assume true; {4600#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:23,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {4600#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4601#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:23,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {4601#(<= main_~i~0 7)} assume true; {4601#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:23,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {4601#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4602#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:23,885 INFO L273 TraceCheckUtils]: 22: Hoare triple {4602#(<= main_~i~0 8)} assume true; {4602#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:23,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {4602#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4603#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:23,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {4603#(<= main_~i~0 9)} assume true; {4603#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:23,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {4603#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4604#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:23,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {4604#(<= main_~i~0 10)} assume true; {4604#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:23,896 INFO L273 TraceCheckUtils]: 27: Hoare triple {4604#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4605#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:23,896 INFO L273 TraceCheckUtils]: 28: Hoare triple {4605#(<= main_~i~0 11)} assume true; {4605#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:23,899 INFO L273 TraceCheckUtils]: 29: Hoare triple {4605#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4606#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:23,899 INFO L273 TraceCheckUtils]: 30: Hoare triple {4606#(<= main_~i~0 12)} assume true; {4606#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:23,902 INFO L273 TraceCheckUtils]: 31: Hoare triple {4606#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4607#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:23,902 INFO L273 TraceCheckUtils]: 32: Hoare triple {4607#(<= main_~i~0 13)} assume true; {4607#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:23,904 INFO L273 TraceCheckUtils]: 33: Hoare triple {4607#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4608#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:23,904 INFO L273 TraceCheckUtils]: 34: Hoare triple {4608#(<= main_~i~0 14)} assume true; {4608#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:23,906 INFO L273 TraceCheckUtils]: 35: Hoare triple {4608#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4593#false} is VALID [2018-11-14 18:46:23,906 INFO L273 TraceCheckUtils]: 36: Hoare triple {4593#false} ~i~0 := 1; {4593#false} is VALID [2018-11-14 18:46:23,906 INFO L273 TraceCheckUtils]: 37: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:23,906 INFO L273 TraceCheckUtils]: 38: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:23,906 INFO L273 TraceCheckUtils]: 39: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:23,906 INFO L273 TraceCheckUtils]: 40: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:23,906 INFO L273 TraceCheckUtils]: 41: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:23,907 INFO L273 TraceCheckUtils]: 42: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:23,907 INFO L273 TraceCheckUtils]: 43: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:23,907 INFO L273 TraceCheckUtils]: 44: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:23,907 INFO L273 TraceCheckUtils]: 45: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:23,907 INFO L273 TraceCheckUtils]: 46: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:23,907 INFO L273 TraceCheckUtils]: 47: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:23,907 INFO L273 TraceCheckUtils]: 48: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:23,907 INFO L273 TraceCheckUtils]: 49: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:23,908 INFO L273 TraceCheckUtils]: 50: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:23,908 INFO L273 TraceCheckUtils]: 51: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:23,908 INFO L273 TraceCheckUtils]: 52: Hoare triple {4593#false} assume !(~i~0 < 100000); {4593#false} is VALID [2018-11-14 18:46:23,908 INFO L273 TraceCheckUtils]: 53: Hoare triple {4593#false} ~i~0 := 1;~j~0 := 0; {4593#false} is VALID [2018-11-14 18:46:23,908 INFO L273 TraceCheckUtils]: 54: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:23,908 INFO L273 TraceCheckUtils]: 55: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {4593#false} is VALID [2018-11-14 18:46:23,908 INFO L256 TraceCheckUtils]: 56: Hoare triple {4593#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4593#false} is VALID [2018-11-14 18:46:23,908 INFO L273 TraceCheckUtils]: 57: Hoare triple {4593#false} ~cond := #in~cond; {4593#false} is VALID [2018-11-14 18:46:23,909 INFO L273 TraceCheckUtils]: 58: Hoare triple {4593#false} assume ~cond == 0; {4593#false} is VALID [2018-11-14 18:46:23,909 INFO L273 TraceCheckUtils]: 59: Hoare triple {4593#false} assume !false; {4593#false} is VALID [2018-11-14 18:46:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 18:46:23,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:23,911 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-14 18:46:23,920 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:46:25,754 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-11-14 18:46:25,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:25,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:25,976 INFO L256 TraceCheckUtils]: 0: Hoare triple {4592#true} call ULTIMATE.init(); {4592#true} is VALID [2018-11-14 18:46:25,977 INFO L273 TraceCheckUtils]: 1: Hoare triple {4592#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4592#true} is VALID [2018-11-14 18:46:25,977 INFO L273 TraceCheckUtils]: 2: Hoare triple {4592#true} assume true; {4592#true} is VALID [2018-11-14 18:46:25,977 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4592#true} {4592#true} #63#return; {4592#true} is VALID [2018-11-14 18:46:25,977 INFO L256 TraceCheckUtils]: 4: Hoare triple {4592#true} call #t~ret4 := main(); {4592#true} is VALID [2018-11-14 18:46:25,978 INFO L273 TraceCheckUtils]: 5: Hoare triple {4592#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; {4627#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:25,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {4627#(<= main_~i~0 0)} assume true; {4627#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:25,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {4627#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4595#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:25,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {4595#(<= main_~i~0 1)} assume true; {4595#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:25,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {4595#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4596#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:25,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {4596#(<= main_~i~0 2)} assume true; {4596#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:25,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {4596#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4597#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:25,982 INFO L273 TraceCheckUtils]: 12: Hoare triple {4597#(<= main_~i~0 3)} assume true; {4597#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:25,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {4597#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4598#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:25,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {4598#(<= main_~i~0 4)} assume true; {4598#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:25,985 INFO L273 TraceCheckUtils]: 15: Hoare triple {4598#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4599#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:25,985 INFO L273 TraceCheckUtils]: 16: Hoare triple {4599#(<= main_~i~0 5)} assume true; {4599#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:25,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {4599#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4600#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:25,987 INFO L273 TraceCheckUtils]: 18: Hoare triple {4600#(<= main_~i~0 6)} assume true; {4600#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:25,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {4600#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4601#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:25,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {4601#(<= main_~i~0 7)} assume true; {4601#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:25,990 INFO L273 TraceCheckUtils]: 21: Hoare triple {4601#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4602#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:25,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {4602#(<= main_~i~0 8)} assume true; {4602#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:25,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {4602#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4603#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:25,992 INFO L273 TraceCheckUtils]: 24: Hoare triple {4603#(<= main_~i~0 9)} assume true; {4603#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:25,993 INFO L273 TraceCheckUtils]: 25: Hoare triple {4603#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4604#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:25,993 INFO L273 TraceCheckUtils]: 26: Hoare triple {4604#(<= main_~i~0 10)} assume true; {4604#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:25,994 INFO L273 TraceCheckUtils]: 27: Hoare triple {4604#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4605#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:25,995 INFO L273 TraceCheckUtils]: 28: Hoare triple {4605#(<= main_~i~0 11)} assume true; {4605#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:25,996 INFO L273 TraceCheckUtils]: 29: Hoare triple {4605#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4606#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:25,997 INFO L273 TraceCheckUtils]: 30: Hoare triple {4606#(<= main_~i~0 12)} assume true; {4606#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:25,998 INFO L273 TraceCheckUtils]: 31: Hoare triple {4606#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4607#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:25,998 INFO L273 TraceCheckUtils]: 32: Hoare triple {4607#(<= main_~i~0 13)} assume true; {4607#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:25,999 INFO L273 TraceCheckUtils]: 33: Hoare triple {4607#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4608#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:26,000 INFO L273 TraceCheckUtils]: 34: Hoare triple {4608#(<= main_~i~0 14)} assume true; {4608#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:26,001 INFO L273 TraceCheckUtils]: 35: Hoare triple {4608#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4593#false} is VALID [2018-11-14 18:46:26,001 INFO L273 TraceCheckUtils]: 36: Hoare triple {4593#false} ~i~0 := 1; {4593#false} is VALID [2018-11-14 18:46:26,001 INFO L273 TraceCheckUtils]: 37: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:26,002 INFO L273 TraceCheckUtils]: 38: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:26,002 INFO L273 TraceCheckUtils]: 39: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:26,003 INFO L273 TraceCheckUtils]: 40: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:26,003 INFO L273 TraceCheckUtils]: 41: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:26,003 INFO L273 TraceCheckUtils]: 42: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:26,004 INFO L273 TraceCheckUtils]: 43: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:26,004 INFO L273 TraceCheckUtils]: 44: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:26,004 INFO L273 TraceCheckUtils]: 45: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:26,004 INFO L273 TraceCheckUtils]: 46: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:26,005 INFO L273 TraceCheckUtils]: 47: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:26,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:26,005 INFO L273 TraceCheckUtils]: 49: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:26,005 INFO L273 TraceCheckUtils]: 50: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {4593#false} is VALID [2018-11-14 18:46:26,006 INFO L273 TraceCheckUtils]: 51: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:26,006 INFO L273 TraceCheckUtils]: 52: Hoare triple {4593#false} assume !(~i~0 < 100000); {4593#false} is VALID [2018-11-14 18:46:26,006 INFO L273 TraceCheckUtils]: 53: Hoare triple {4593#false} ~i~0 := 1;~j~0 := 0; {4593#false} is VALID [2018-11-14 18:46:26,006 INFO L273 TraceCheckUtils]: 54: Hoare triple {4593#false} assume true; {4593#false} is VALID [2018-11-14 18:46:26,006 INFO L273 TraceCheckUtils]: 55: Hoare triple {4593#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {4593#false} is VALID [2018-11-14 18:46:26,007 INFO L256 TraceCheckUtils]: 56: Hoare triple {4593#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4593#false} is VALID [2018-11-14 18:46:26,007 INFO L273 TraceCheckUtils]: 57: Hoare triple {4593#false} ~cond := #in~cond; {4593#false} is VALID [2018-11-14 18:46:26,007 INFO L273 TraceCheckUtils]: 58: Hoare triple {4593#false} assume ~cond == 0; {4593#false} is VALID [2018-11-14 18:46:26,007 INFO L273 TraceCheckUtils]: 59: Hoare triple {4593#false} assume !false; {4593#false} is VALID [2018-11-14 18:46:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 18:46:26,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:26,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 18:46:26,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-11-14 18:46:26,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:26,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:46:26,084 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-14 18:46:26,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:46:26,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:46:26,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:46:26,085 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 18 states. [2018-11-14 18:46:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:26,758 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-11-14 18:46:26,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 18:46:26,758 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-11-14 18:46:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:46:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 119 transitions. [2018-11-14 18:46:26,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:46:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 119 transitions. [2018-11-14 18:46:26,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 119 transitions. [2018-11-14 18:46:27,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:27,511 INFO L225 Difference]: With dead ends: 122 [2018-11-14 18:46:27,511 INFO L226 Difference]: Without dead ends: 94 [2018-11-14 18:46:27,512 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:46:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-14 18:46:27,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2018-11-14 18:46:27,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:27,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 66 states. [2018-11-14 18:46:27,539 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 66 states. [2018-11-14 18:46:27,539 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 66 states. [2018-11-14 18:46:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:27,541 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-14 18:46:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-11-14 18:46:27,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:27,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:27,542 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 94 states. [2018-11-14 18:46:27,542 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 94 states. [2018-11-14 18:46:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:27,545 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-14 18:46:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-11-14 18:46:27,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:27,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:27,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:27,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 18:46:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-14 18:46:27,548 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 60 [2018-11-14 18:46:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:27,548 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-14 18:46:27,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:46:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-14 18:46:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-14 18:46:27,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:27,549 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:27,549 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:27,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:27,550 INFO L82 PathProgramCache]: Analyzing trace with hash -307618275, now seen corresponding path program 12 times [2018-11-14 18:46:27,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:27,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:27,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:27,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:27,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:28,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {5252#true} call ULTIMATE.init(); {5252#true} is VALID [2018-11-14 18:46:28,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {5252#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5252#true} is VALID [2018-11-14 18:46:28,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:28,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5252#true} {5252#true} #63#return; {5252#true} is VALID [2018-11-14 18:46:28,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {5252#true} call #t~ret4 := main(); {5252#true} is VALID [2018-11-14 18:46:28,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {5252#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; {5254#(= main_~i~0 0)} is VALID [2018-11-14 18:46:28,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {5254#(= main_~i~0 0)} assume true; {5254#(= main_~i~0 0)} is VALID [2018-11-14 18:46:28,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {5254#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5255#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:28,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#(<= main_~i~0 1)} assume true; {5255#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:28,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {5255#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5256#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:28,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {5256#(<= main_~i~0 2)} assume true; {5256#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:28,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {5256#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5257#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:28,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {5257#(<= main_~i~0 3)} assume true; {5257#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:28,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {5257#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5258#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:28,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {5258#(<= main_~i~0 4)} assume true; {5258#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:28,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {5258#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5259#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:28,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {5259#(<= main_~i~0 5)} assume true; {5259#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:28,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {5259#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5260#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:28,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {5260#(<= main_~i~0 6)} assume true; {5260#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:28,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {5260#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5261#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:28,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {5261#(<= main_~i~0 7)} assume true; {5261#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:28,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {5261#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5262#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:28,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {5262#(<= main_~i~0 8)} assume true; {5262#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:28,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {5262#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5263#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:28,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {5263#(<= main_~i~0 9)} assume true; {5263#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:28,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {5263#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5264#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:28,652 INFO L273 TraceCheckUtils]: 26: Hoare triple {5264#(<= main_~i~0 10)} assume true; {5264#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:28,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {5264#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5265#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:28,653 INFO L273 TraceCheckUtils]: 28: Hoare triple {5265#(<= main_~i~0 11)} assume true; {5265#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:28,654 INFO L273 TraceCheckUtils]: 29: Hoare triple {5265#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5266#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:28,655 INFO L273 TraceCheckUtils]: 30: Hoare triple {5266#(<= main_~i~0 12)} assume true; {5266#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:28,656 INFO L273 TraceCheckUtils]: 31: Hoare triple {5266#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5267#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:28,656 INFO L273 TraceCheckUtils]: 32: Hoare triple {5267#(<= main_~i~0 13)} assume true; {5267#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:28,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {5267#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5268#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:28,658 INFO L273 TraceCheckUtils]: 34: Hoare triple {5268#(<= main_~i~0 14)} assume true; {5268#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:28,659 INFO L273 TraceCheckUtils]: 35: Hoare triple {5268#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5269#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:28,659 INFO L273 TraceCheckUtils]: 36: Hoare triple {5269#(<= main_~i~0 15)} assume true; {5269#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:28,660 INFO L273 TraceCheckUtils]: 37: Hoare triple {5269#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5253#false} is VALID [2018-11-14 18:46:28,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {5253#false} ~i~0 := 1; {5253#false} is VALID [2018-11-14 18:46:28,661 INFO L273 TraceCheckUtils]: 39: Hoare triple {5253#false} assume true; {5253#false} is VALID [2018-11-14 18:46:28,661 INFO L273 TraceCheckUtils]: 40: Hoare triple {5253#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5253#false} is VALID [2018-11-14 18:46:28,661 INFO L273 TraceCheckUtils]: 41: Hoare triple {5253#false} assume true; {5253#false} is VALID [2018-11-14 18:46:28,661 INFO L273 TraceCheckUtils]: 42: Hoare triple {5253#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5253#false} is VALID [2018-11-14 18:46:28,661 INFO L273 TraceCheckUtils]: 43: Hoare triple {5253#false} assume true; {5253#false} is VALID [2018-11-14 18:46:28,662 INFO L273 TraceCheckUtils]: 44: Hoare triple {5253#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5253#false} is VALID [2018-11-14 18:46:28,662 INFO L273 TraceCheckUtils]: 45: Hoare triple {5253#false} assume true; {5253#false} is VALID [2018-11-14 18:46:28,662 INFO L273 TraceCheckUtils]: 46: Hoare triple {5253#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5253#false} is VALID [2018-11-14 18:46:28,662 INFO L273 TraceCheckUtils]: 47: Hoare triple {5253#false} assume true; {5253#false} is VALID [2018-11-14 18:46:28,662 INFO L273 TraceCheckUtils]: 48: Hoare triple {5253#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5253#false} is VALID [2018-11-14 18:46:28,662 INFO L273 TraceCheckUtils]: 49: Hoare triple {5253#false} assume true; {5253#false} is VALID [2018-11-14 18:46:28,663 INFO L273 TraceCheckUtils]: 50: Hoare triple {5253#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5253#false} is VALID [2018-11-14 18:46:28,663 INFO L273 TraceCheckUtils]: 51: Hoare triple {5253#false} assume true; {5253#false} is VALID [2018-11-14 18:46:28,663 INFO L273 TraceCheckUtils]: 52: Hoare triple {5253#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5253#false} is VALID [2018-11-14 18:46:28,663 INFO L273 TraceCheckUtils]: 53: Hoare triple {5253#false} assume true; {5253#false} is VALID [2018-11-14 18:46:28,663 INFO L273 TraceCheckUtils]: 54: Hoare triple {5253#false} assume !(~i~0 < 100000); {5253#false} is VALID [2018-11-14 18:46:28,663 INFO L273 TraceCheckUtils]: 55: Hoare triple {5253#false} ~i~0 := 1;~j~0 := 0; {5253#false} is VALID [2018-11-14 18:46:28,664 INFO L273 TraceCheckUtils]: 56: Hoare triple {5253#false} assume true; {5253#false} is VALID [2018-11-14 18:46:28,664 INFO L273 TraceCheckUtils]: 57: Hoare triple {5253#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {5253#false} is VALID [2018-11-14 18:46:28,664 INFO L256 TraceCheckUtils]: 58: Hoare triple {5253#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5253#false} is VALID [2018-11-14 18:46:28,664 INFO L273 TraceCheckUtils]: 59: Hoare triple {5253#false} ~cond := #in~cond; {5253#false} is VALID [2018-11-14 18:46:28,664 INFO L273 TraceCheckUtils]: 60: Hoare triple {5253#false} assume ~cond == 0; {5253#false} is VALID [2018-11-14 18:46:28,664 INFO L273 TraceCheckUtils]: 61: Hoare triple {5253#false} assume !false; {5253#false} is VALID [2018-11-14 18:46:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 18:46:28,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:28,667 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-14 18:46:28,674 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:46:29,910 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-14 18:46:29,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:29,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:30,023 INFO L256 TraceCheckUtils]: 0: Hoare triple {5252#true} call ULTIMATE.init(); {5252#true} is VALID [2018-11-14 18:46:30,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {5252#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5252#true} is VALID [2018-11-14 18:46:30,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,024 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5252#true} {5252#true} #63#return; {5252#true} is VALID [2018-11-14 18:46:30,024 INFO L256 TraceCheckUtils]: 4: Hoare triple {5252#true} call #t~ret4 := main(); {5252#true} is VALID [2018-11-14 18:46:30,025 INFO L273 TraceCheckUtils]: 5: Hoare triple {5252#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; {5252#true} is VALID [2018-11-14 18:46:30,025 INFO L273 TraceCheckUtils]: 6: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,025 INFO L273 TraceCheckUtils]: 7: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,025 INFO L273 TraceCheckUtils]: 8: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,026 INFO L273 TraceCheckUtils]: 10: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,026 INFO L273 TraceCheckUtils]: 15: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,027 INFO L273 TraceCheckUtils]: 19: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,027 INFO L273 TraceCheckUtils]: 20: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,027 INFO L273 TraceCheckUtils]: 21: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,027 INFO L273 TraceCheckUtils]: 22: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,027 INFO L273 TraceCheckUtils]: 23: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,027 INFO L273 TraceCheckUtils]: 24: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,027 INFO L273 TraceCheckUtils]: 25: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,028 INFO L273 TraceCheckUtils]: 26: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,028 INFO L273 TraceCheckUtils]: 27: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,028 INFO L273 TraceCheckUtils]: 28: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,028 INFO L273 TraceCheckUtils]: 29: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,028 INFO L273 TraceCheckUtils]: 30: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,028 INFO L273 TraceCheckUtils]: 31: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,028 INFO L273 TraceCheckUtils]: 32: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,028 INFO L273 TraceCheckUtils]: 33: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,029 INFO L273 TraceCheckUtils]: 34: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,029 INFO L273 TraceCheckUtils]: 35: Hoare triple {5252#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5252#true} is VALID [2018-11-14 18:46:30,029 INFO L273 TraceCheckUtils]: 36: Hoare triple {5252#true} assume true; {5252#true} is VALID [2018-11-14 18:46:30,029 INFO L273 TraceCheckUtils]: 37: Hoare triple {5252#true} assume !(~i~0 < 100000); {5252#true} is VALID [2018-11-14 18:46:30,029 INFO L273 TraceCheckUtils]: 38: Hoare triple {5252#true} ~i~0 := 1; {5255#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:30,030 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#(<= main_~i~0 1)} assume true; {5255#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:30,030 INFO L273 TraceCheckUtils]: 40: Hoare triple {5255#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5257#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:30,031 INFO L273 TraceCheckUtils]: 41: Hoare triple {5257#(<= main_~i~0 3)} assume true; {5257#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:30,031 INFO L273 TraceCheckUtils]: 42: Hoare triple {5257#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5259#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:30,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {5259#(<= main_~i~0 5)} assume true; {5259#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:30,032 INFO L273 TraceCheckUtils]: 44: Hoare triple {5259#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5261#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:30,032 INFO L273 TraceCheckUtils]: 45: Hoare triple {5261#(<= main_~i~0 7)} assume true; {5261#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:30,033 INFO L273 TraceCheckUtils]: 46: Hoare triple {5261#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5263#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:30,033 INFO L273 TraceCheckUtils]: 47: Hoare triple {5263#(<= main_~i~0 9)} assume true; {5263#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:30,034 INFO L273 TraceCheckUtils]: 48: Hoare triple {5263#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5265#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:30,035 INFO L273 TraceCheckUtils]: 49: Hoare triple {5265#(<= main_~i~0 11)} assume true; {5265#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:30,036 INFO L273 TraceCheckUtils]: 50: Hoare triple {5265#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5267#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:30,036 INFO L273 TraceCheckUtils]: 51: Hoare triple {5267#(<= main_~i~0 13)} assume true; {5267#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:30,037 INFO L273 TraceCheckUtils]: 52: Hoare triple {5267#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5269#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:30,038 INFO L273 TraceCheckUtils]: 53: Hoare triple {5269#(<= main_~i~0 15)} assume true; {5269#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:30,039 INFO L273 TraceCheckUtils]: 54: Hoare triple {5269#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5253#false} is VALID [2018-11-14 18:46:30,039 INFO L273 TraceCheckUtils]: 55: Hoare triple {5253#false} ~i~0 := 1;~j~0 := 0; {5253#false} is VALID [2018-11-14 18:46:30,039 INFO L273 TraceCheckUtils]: 56: Hoare triple {5253#false} assume true; {5253#false} is VALID [2018-11-14 18:46:30,039 INFO L273 TraceCheckUtils]: 57: Hoare triple {5253#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {5253#false} is VALID [2018-11-14 18:46:30,040 INFO L256 TraceCheckUtils]: 58: Hoare triple {5253#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5253#false} is VALID [2018-11-14 18:46:30,040 INFO L273 TraceCheckUtils]: 59: Hoare triple {5253#false} ~cond := #in~cond; {5253#false} is VALID [2018-11-14 18:46:30,040 INFO L273 TraceCheckUtils]: 60: Hoare triple {5253#false} assume ~cond == 0; {5253#false} is VALID [2018-11-14 18:46:30,040 INFO L273 TraceCheckUtils]: 61: Hoare triple {5253#false} assume !false; {5253#false} is VALID [2018-11-14 18:46:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-11-14 18:46:30,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:30,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 18 [2018-11-14 18:46:30,064 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-11-14 18:46:30,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:30,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:46:30,130 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-14 18:46:30,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:46:30,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:46:30,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:46:30,131 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 18 states. [2018-11-14 18:46:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:30,882 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2018-11-14 18:46:30,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 18:46:30,882 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-11-14 18:46:30,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:46:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-14 18:46:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:46:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-14 18:46:30,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 129 transitions. [2018-11-14 18:46:31,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:31,303 INFO L225 Difference]: With dead ends: 130 [2018-11-14 18:46:31,303 INFO L226 Difference]: Without dead ends: 102 [2018-11-14 18:46:31,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:46:31,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-14 18:46:31,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2018-11-14 18:46:31,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:31,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 70 states. [2018-11-14 18:46:31,375 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 70 states. [2018-11-14 18:46:31,375 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 70 states. [2018-11-14 18:46:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:31,378 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-11-14 18:46:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-11-14 18:46:31,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:31,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:31,380 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 102 states. [2018-11-14 18:46:31,380 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 102 states. [2018-11-14 18:46:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:31,383 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-11-14 18:46:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-11-14 18:46:31,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:31,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:31,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:31,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 18:46:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-11-14 18:46:31,386 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 62 [2018-11-14 18:46:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:31,387 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-14 18:46:31,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:46:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-14 18:46:31,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-14 18:46:31,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:31,388 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:31,388 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:31,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:31,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1450660771, now seen corresponding path program 13 times [2018-11-14 18:46:31,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:31,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:31,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:31,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:31,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:32,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {5952#true} call ULTIMATE.init(); {5952#true} is VALID [2018-11-14 18:46:32,508 INFO L273 TraceCheckUtils]: 1: Hoare triple {5952#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5952#true} is VALID [2018-11-14 18:46:32,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2018-11-14 18:46:32,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #63#return; {5952#true} is VALID [2018-11-14 18:46:32,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret4 := main(); {5952#true} is VALID [2018-11-14 18:46:32,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {5952#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; {5954#(= main_~i~0 0)} is VALID [2018-11-14 18:46:32,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {5954#(= main_~i~0 0)} assume true; {5954#(= main_~i~0 0)} is VALID [2018-11-14 18:46:32,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {5954#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5955#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:32,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {5955#(<= main_~i~0 1)} assume true; {5955#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:32,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {5955#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5956#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:32,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {5956#(<= main_~i~0 2)} assume true; {5956#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:32,512 INFO L273 TraceCheckUtils]: 11: Hoare triple {5956#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5957#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:32,512 INFO L273 TraceCheckUtils]: 12: Hoare triple {5957#(<= main_~i~0 3)} assume true; {5957#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:32,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {5957#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5958#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:32,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {5958#(<= main_~i~0 4)} assume true; {5958#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:32,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {5958#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5959#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:32,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {5959#(<= main_~i~0 5)} assume true; {5959#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:32,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {5959#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5960#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:32,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {5960#(<= main_~i~0 6)} assume true; {5960#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:32,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {5960#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5961#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:32,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {5961#(<= main_~i~0 7)} assume true; {5961#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:32,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {5961#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5962#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:32,520 INFO L273 TraceCheckUtils]: 22: Hoare triple {5962#(<= main_~i~0 8)} assume true; {5962#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:32,521 INFO L273 TraceCheckUtils]: 23: Hoare triple {5962#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5963#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:32,522 INFO L273 TraceCheckUtils]: 24: Hoare triple {5963#(<= main_~i~0 9)} assume true; {5963#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:32,523 INFO L273 TraceCheckUtils]: 25: Hoare triple {5963#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5964#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:32,523 INFO L273 TraceCheckUtils]: 26: Hoare triple {5964#(<= main_~i~0 10)} assume true; {5964#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:32,524 INFO L273 TraceCheckUtils]: 27: Hoare triple {5964#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5965#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:32,525 INFO L273 TraceCheckUtils]: 28: Hoare triple {5965#(<= main_~i~0 11)} assume true; {5965#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:32,526 INFO L273 TraceCheckUtils]: 29: Hoare triple {5965#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5966#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:32,526 INFO L273 TraceCheckUtils]: 30: Hoare triple {5966#(<= main_~i~0 12)} assume true; {5966#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:32,527 INFO L273 TraceCheckUtils]: 31: Hoare triple {5966#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5967#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:32,528 INFO L273 TraceCheckUtils]: 32: Hoare triple {5967#(<= main_~i~0 13)} assume true; {5967#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:32,529 INFO L273 TraceCheckUtils]: 33: Hoare triple {5967#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5968#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:32,529 INFO L273 TraceCheckUtils]: 34: Hoare triple {5968#(<= main_~i~0 14)} assume true; {5968#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:32,530 INFO L273 TraceCheckUtils]: 35: Hoare triple {5968#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5969#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:32,531 INFO L273 TraceCheckUtils]: 36: Hoare triple {5969#(<= main_~i~0 15)} assume true; {5969#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:32,532 INFO L273 TraceCheckUtils]: 37: Hoare triple {5969#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5970#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:32,532 INFO L273 TraceCheckUtils]: 38: Hoare triple {5970#(<= main_~i~0 16)} assume true; {5970#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:32,533 INFO L273 TraceCheckUtils]: 39: Hoare triple {5970#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5953#false} is VALID [2018-11-14 18:46:32,533 INFO L273 TraceCheckUtils]: 40: Hoare triple {5953#false} ~i~0 := 1; {5953#false} is VALID [2018-11-14 18:46:32,533 INFO L273 TraceCheckUtils]: 41: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,534 INFO L273 TraceCheckUtils]: 42: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,534 INFO L273 TraceCheckUtils]: 43: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,534 INFO L273 TraceCheckUtils]: 44: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,534 INFO L273 TraceCheckUtils]: 45: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,535 INFO L273 TraceCheckUtils]: 46: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,535 INFO L273 TraceCheckUtils]: 47: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,535 INFO L273 TraceCheckUtils]: 48: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,535 INFO L273 TraceCheckUtils]: 49: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,535 INFO L273 TraceCheckUtils]: 50: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,535 INFO L273 TraceCheckUtils]: 51: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,536 INFO L273 TraceCheckUtils]: 52: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,536 INFO L273 TraceCheckUtils]: 53: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,536 INFO L273 TraceCheckUtils]: 54: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,536 INFO L273 TraceCheckUtils]: 55: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,536 INFO L273 TraceCheckUtils]: 56: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,536 INFO L273 TraceCheckUtils]: 57: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,536 INFO L273 TraceCheckUtils]: 58: Hoare triple {5953#false} assume !(~i~0 < 100000); {5953#false} is VALID [2018-11-14 18:46:32,536 INFO L273 TraceCheckUtils]: 59: Hoare triple {5953#false} ~i~0 := 1;~j~0 := 0; {5953#false} is VALID [2018-11-14 18:46:32,537 INFO L273 TraceCheckUtils]: 60: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,537 INFO L273 TraceCheckUtils]: 61: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {5953#false} is VALID [2018-11-14 18:46:32,537 INFO L256 TraceCheckUtils]: 62: Hoare triple {5953#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5953#false} is VALID [2018-11-14 18:46:32,537 INFO L273 TraceCheckUtils]: 63: Hoare triple {5953#false} ~cond := #in~cond; {5953#false} is VALID [2018-11-14 18:46:32,537 INFO L273 TraceCheckUtils]: 64: Hoare triple {5953#false} assume ~cond == 0; {5953#false} is VALID [2018-11-14 18:46:32,537 INFO L273 TraceCheckUtils]: 65: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2018-11-14 18:46:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-14 18:46:32,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:32,540 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-14 18:46:32,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:32,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:32,775 INFO L256 TraceCheckUtils]: 0: Hoare triple {5952#true} call ULTIMATE.init(); {5952#true} is VALID [2018-11-14 18:46:32,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {5952#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5952#true} is VALID [2018-11-14 18:46:32,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2018-11-14 18:46:32,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #63#return; {5952#true} is VALID [2018-11-14 18:46:32,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret4 := main(); {5952#true} is VALID [2018-11-14 18:46:32,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {5952#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; {5989#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:32,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {5989#(<= main_~i~0 0)} assume true; {5989#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:32,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {5989#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5955#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:32,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {5955#(<= main_~i~0 1)} assume true; {5955#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:32,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {5955#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5956#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:32,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {5956#(<= main_~i~0 2)} assume true; {5956#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:32,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {5956#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5957#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:32,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {5957#(<= main_~i~0 3)} assume true; {5957#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:32,801 INFO L273 TraceCheckUtils]: 13: Hoare triple {5957#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5958#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:32,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {5958#(<= main_~i~0 4)} assume true; {5958#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:32,826 INFO L273 TraceCheckUtils]: 15: Hoare triple {5958#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5959#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:32,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {5959#(<= main_~i~0 5)} assume true; {5959#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:32,849 INFO L273 TraceCheckUtils]: 17: Hoare triple {5959#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5960#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:32,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {5960#(<= main_~i~0 6)} assume true; {5960#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:32,854 INFO L273 TraceCheckUtils]: 19: Hoare triple {5960#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5961#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:32,854 INFO L273 TraceCheckUtils]: 20: Hoare triple {5961#(<= main_~i~0 7)} assume true; {5961#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:32,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {5961#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5962#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:32,855 INFO L273 TraceCheckUtils]: 22: Hoare triple {5962#(<= main_~i~0 8)} assume true; {5962#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:32,857 INFO L273 TraceCheckUtils]: 23: Hoare triple {5962#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5963#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:32,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {5963#(<= main_~i~0 9)} assume true; {5963#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:32,858 INFO L273 TraceCheckUtils]: 25: Hoare triple {5963#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5964#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:32,859 INFO L273 TraceCheckUtils]: 26: Hoare triple {5964#(<= main_~i~0 10)} assume true; {5964#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:32,860 INFO L273 TraceCheckUtils]: 27: Hoare triple {5964#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5965#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:32,860 INFO L273 TraceCheckUtils]: 28: Hoare triple {5965#(<= main_~i~0 11)} assume true; {5965#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:32,861 INFO L273 TraceCheckUtils]: 29: Hoare triple {5965#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5966#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:32,862 INFO L273 TraceCheckUtils]: 30: Hoare triple {5966#(<= main_~i~0 12)} assume true; {5966#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:32,863 INFO L273 TraceCheckUtils]: 31: Hoare triple {5966#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5967#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:32,863 INFO L273 TraceCheckUtils]: 32: Hoare triple {5967#(<= main_~i~0 13)} assume true; {5967#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:32,864 INFO L273 TraceCheckUtils]: 33: Hoare triple {5967#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5968#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:32,865 INFO L273 TraceCheckUtils]: 34: Hoare triple {5968#(<= main_~i~0 14)} assume true; {5968#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:32,866 INFO L273 TraceCheckUtils]: 35: Hoare triple {5968#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5969#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:32,866 INFO L273 TraceCheckUtils]: 36: Hoare triple {5969#(<= main_~i~0 15)} assume true; {5969#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:32,867 INFO L273 TraceCheckUtils]: 37: Hoare triple {5969#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5970#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:32,868 INFO L273 TraceCheckUtils]: 38: Hoare triple {5970#(<= main_~i~0 16)} assume true; {5970#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:32,869 INFO L273 TraceCheckUtils]: 39: Hoare triple {5970#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5953#false} is VALID [2018-11-14 18:46:32,869 INFO L273 TraceCheckUtils]: 40: Hoare triple {5953#false} ~i~0 := 1; {5953#false} is VALID [2018-11-14 18:46:32,869 INFO L273 TraceCheckUtils]: 41: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,869 INFO L273 TraceCheckUtils]: 42: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,870 INFO L273 TraceCheckUtils]: 43: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,870 INFO L273 TraceCheckUtils]: 44: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,870 INFO L273 TraceCheckUtils]: 45: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,870 INFO L273 TraceCheckUtils]: 46: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,870 INFO L273 TraceCheckUtils]: 47: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,871 INFO L273 TraceCheckUtils]: 48: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,871 INFO L273 TraceCheckUtils]: 49: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,871 INFO L273 TraceCheckUtils]: 50: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,871 INFO L273 TraceCheckUtils]: 51: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,871 INFO L273 TraceCheckUtils]: 52: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,872 INFO L273 TraceCheckUtils]: 53: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,872 INFO L273 TraceCheckUtils]: 54: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,872 INFO L273 TraceCheckUtils]: 55: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,872 INFO L273 TraceCheckUtils]: 56: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {5953#false} is VALID [2018-11-14 18:46:32,872 INFO L273 TraceCheckUtils]: 57: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,872 INFO L273 TraceCheckUtils]: 58: Hoare triple {5953#false} assume !(~i~0 < 100000); {5953#false} is VALID [2018-11-14 18:46:32,872 INFO L273 TraceCheckUtils]: 59: Hoare triple {5953#false} ~i~0 := 1;~j~0 := 0; {5953#false} is VALID [2018-11-14 18:46:32,873 INFO L273 TraceCheckUtils]: 60: Hoare triple {5953#false} assume true; {5953#false} is VALID [2018-11-14 18:46:32,873 INFO L273 TraceCheckUtils]: 61: Hoare triple {5953#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {5953#false} is VALID [2018-11-14 18:46:32,873 INFO L256 TraceCheckUtils]: 62: Hoare triple {5953#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5953#false} is VALID [2018-11-14 18:46:32,873 INFO L273 TraceCheckUtils]: 63: Hoare triple {5953#false} ~cond := #in~cond; {5953#false} is VALID [2018-11-14 18:46:32,873 INFO L273 TraceCheckUtils]: 64: Hoare triple {5953#false} assume ~cond == 0; {5953#false} is VALID [2018-11-14 18:46:32,873 INFO L273 TraceCheckUtils]: 65: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2018-11-14 18:46:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-14 18:46:32,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:32,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 18:46:32,896 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2018-11-14 18:46:32,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:32,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 18:46:32,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:32,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 18:46:32,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 18:46:32,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:46:32,948 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 20 states. [2018-11-14 18:46:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:33,656 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2018-11-14 18:46:33,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 18:46:33,656 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2018-11-14 18:46:33,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:46:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2018-11-14 18:46:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:46:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2018-11-14 18:46:33,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 130 transitions. [2018-11-14 18:46:33,787 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-14 18:46:33,790 INFO L225 Difference]: With dead ends: 134 [2018-11-14 18:46:33,790 INFO L226 Difference]: Without dead ends: 104 [2018-11-14 18:46:33,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:46:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-14 18:46:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2018-11-14 18:46:33,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:33,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 72 states. [2018-11-14 18:46:33,820 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 72 states. [2018-11-14 18:46:33,820 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 72 states. [2018-11-14 18:46:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:33,824 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-11-14 18:46:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-11-14 18:46:33,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:33,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:33,825 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 104 states. [2018-11-14 18:46:33,825 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 104 states. [2018-11-14 18:46:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:33,828 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-11-14 18:46:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-11-14 18:46:33,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:33,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:33,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:33,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 18:46:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-11-14 18:46:33,831 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 66 [2018-11-14 18:46:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:33,831 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-11-14 18:46:33,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 18:46:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-14 18:46:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-14 18:46:33,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:33,833 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:33,833 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:33,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:33,833 INFO L82 PathProgramCache]: Analyzing trace with hash -787398909, now seen corresponding path program 14 times [2018-11-14 18:46:33,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:33,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:33,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:33,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:33,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:35,480 INFO L256 TraceCheckUtils]: 0: Hoare triple {6679#true} call ULTIMATE.init(); {6679#true} is VALID [2018-11-14 18:46:35,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {6679#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6679#true} is VALID [2018-11-14 18:46:35,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {6679#true} assume true; {6679#true} is VALID [2018-11-14 18:46:35,481 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6679#true} {6679#true} #63#return; {6679#true} is VALID [2018-11-14 18:46:35,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {6679#true} call #t~ret4 := main(); {6679#true} is VALID [2018-11-14 18:46:35,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {6679#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; {6681#(= main_~i~0 0)} is VALID [2018-11-14 18:46:35,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {6681#(= main_~i~0 0)} assume true; {6681#(= main_~i~0 0)} is VALID [2018-11-14 18:46:35,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {6681#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6682#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:35,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {6682#(<= main_~i~0 1)} assume true; {6682#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:35,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {6682#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6683#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:35,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {6683#(<= main_~i~0 2)} assume true; {6683#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:35,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {6683#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6684#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:35,487 INFO L273 TraceCheckUtils]: 12: Hoare triple {6684#(<= main_~i~0 3)} assume true; {6684#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:35,488 INFO L273 TraceCheckUtils]: 13: Hoare triple {6684#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6685#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:35,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {6685#(<= main_~i~0 4)} assume true; {6685#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:35,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {6685#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6686#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:35,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {6686#(<= main_~i~0 5)} assume true; {6686#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:35,491 INFO L273 TraceCheckUtils]: 17: Hoare triple {6686#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6687#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:35,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {6687#(<= main_~i~0 6)} assume true; {6687#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:35,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {6687#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6688#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:35,493 INFO L273 TraceCheckUtils]: 20: Hoare triple {6688#(<= main_~i~0 7)} assume true; {6688#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:35,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {6688#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6689#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:35,494 INFO L273 TraceCheckUtils]: 22: Hoare triple {6689#(<= main_~i~0 8)} assume true; {6689#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:35,495 INFO L273 TraceCheckUtils]: 23: Hoare triple {6689#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6690#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:35,496 INFO L273 TraceCheckUtils]: 24: Hoare triple {6690#(<= main_~i~0 9)} assume true; {6690#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:35,497 INFO L273 TraceCheckUtils]: 25: Hoare triple {6690#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6691#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:35,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {6691#(<= main_~i~0 10)} assume true; {6691#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:35,498 INFO L273 TraceCheckUtils]: 27: Hoare triple {6691#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6692#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:35,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {6692#(<= main_~i~0 11)} assume true; {6692#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:35,500 INFO L273 TraceCheckUtils]: 29: Hoare triple {6692#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6693#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:35,500 INFO L273 TraceCheckUtils]: 30: Hoare triple {6693#(<= main_~i~0 12)} assume true; {6693#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:35,501 INFO L273 TraceCheckUtils]: 31: Hoare triple {6693#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6694#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:35,502 INFO L273 TraceCheckUtils]: 32: Hoare triple {6694#(<= main_~i~0 13)} assume true; {6694#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:35,503 INFO L273 TraceCheckUtils]: 33: Hoare triple {6694#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6695#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:35,504 INFO L273 TraceCheckUtils]: 34: Hoare triple {6695#(<= main_~i~0 14)} assume true; {6695#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:35,504 INFO L273 TraceCheckUtils]: 35: Hoare triple {6695#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6696#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:35,505 INFO L273 TraceCheckUtils]: 36: Hoare triple {6696#(<= main_~i~0 15)} assume true; {6696#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:35,506 INFO L273 TraceCheckUtils]: 37: Hoare triple {6696#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6697#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:35,507 INFO L273 TraceCheckUtils]: 38: Hoare triple {6697#(<= main_~i~0 16)} assume true; {6697#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:35,508 INFO L273 TraceCheckUtils]: 39: Hoare triple {6697#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6698#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:35,508 INFO L273 TraceCheckUtils]: 40: Hoare triple {6698#(<= main_~i~0 17)} assume true; {6698#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:35,509 INFO L273 TraceCheckUtils]: 41: Hoare triple {6698#(<= main_~i~0 17)} assume !(~i~0 < 100000); {6680#false} is VALID [2018-11-14 18:46:35,509 INFO L273 TraceCheckUtils]: 42: Hoare triple {6680#false} ~i~0 := 1; {6680#false} is VALID [2018-11-14 18:46:35,509 INFO L273 TraceCheckUtils]: 43: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,509 INFO L273 TraceCheckUtils]: 44: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,510 INFO L273 TraceCheckUtils]: 45: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,510 INFO L273 TraceCheckUtils]: 46: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,510 INFO L273 TraceCheckUtils]: 47: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,510 INFO L273 TraceCheckUtils]: 48: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,511 INFO L273 TraceCheckUtils]: 49: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,511 INFO L273 TraceCheckUtils]: 50: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,511 INFO L273 TraceCheckUtils]: 51: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,511 INFO L273 TraceCheckUtils]: 52: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,511 INFO L273 TraceCheckUtils]: 53: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,512 INFO L273 TraceCheckUtils]: 54: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,512 INFO L273 TraceCheckUtils]: 55: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,512 INFO L273 TraceCheckUtils]: 56: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,512 INFO L273 TraceCheckUtils]: 57: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,512 INFO L273 TraceCheckUtils]: 58: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,513 INFO L273 TraceCheckUtils]: 59: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,513 INFO L273 TraceCheckUtils]: 60: Hoare triple {6680#false} assume !(~i~0 < 100000); {6680#false} is VALID [2018-11-14 18:46:35,513 INFO L273 TraceCheckUtils]: 61: Hoare triple {6680#false} ~i~0 := 1;~j~0 := 0; {6680#false} is VALID [2018-11-14 18:46:35,513 INFO L273 TraceCheckUtils]: 62: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,513 INFO L273 TraceCheckUtils]: 63: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {6680#false} is VALID [2018-11-14 18:46:35,514 INFO L256 TraceCheckUtils]: 64: Hoare triple {6680#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6680#false} is VALID [2018-11-14 18:46:35,514 INFO L273 TraceCheckUtils]: 65: Hoare triple {6680#false} ~cond := #in~cond; {6680#false} is VALID [2018-11-14 18:46:35,514 INFO L273 TraceCheckUtils]: 66: Hoare triple {6680#false} assume ~cond == 0; {6680#false} is VALID [2018-11-14 18:46:35,514 INFO L273 TraceCheckUtils]: 67: Hoare triple {6680#false} assume !false; {6680#false} is VALID [2018-11-14 18:46:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-14 18:46:35,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:35,517 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-14 18:46:35,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:46:35,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:46:35,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:35,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:35,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {6679#true} call ULTIMATE.init(); {6679#true} is VALID [2018-11-14 18:46:35,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {6679#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6679#true} is VALID [2018-11-14 18:46:35,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {6679#true} assume true; {6679#true} is VALID [2018-11-14 18:46:35,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6679#true} {6679#true} #63#return; {6679#true} is VALID [2018-11-14 18:46:35,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {6679#true} call #t~ret4 := main(); {6679#true} is VALID [2018-11-14 18:46:35,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {6679#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; {6717#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:35,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {6717#(<= main_~i~0 0)} assume true; {6717#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:35,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {6717#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6682#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:35,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {6682#(<= main_~i~0 1)} assume true; {6682#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:35,838 INFO L273 TraceCheckUtils]: 9: Hoare triple {6682#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6683#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:35,838 INFO L273 TraceCheckUtils]: 10: Hoare triple {6683#(<= main_~i~0 2)} assume true; {6683#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:35,839 INFO L273 TraceCheckUtils]: 11: Hoare triple {6683#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6684#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:35,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {6684#(<= main_~i~0 3)} assume true; {6684#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:35,841 INFO L273 TraceCheckUtils]: 13: Hoare triple {6684#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6685#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:35,841 INFO L273 TraceCheckUtils]: 14: Hoare triple {6685#(<= main_~i~0 4)} assume true; {6685#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:35,842 INFO L273 TraceCheckUtils]: 15: Hoare triple {6685#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6686#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:35,843 INFO L273 TraceCheckUtils]: 16: Hoare triple {6686#(<= main_~i~0 5)} assume true; {6686#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:35,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {6686#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6687#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:35,844 INFO L273 TraceCheckUtils]: 18: Hoare triple {6687#(<= main_~i~0 6)} assume true; {6687#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:35,845 INFO L273 TraceCheckUtils]: 19: Hoare triple {6687#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6688#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:35,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {6688#(<= main_~i~0 7)} assume true; {6688#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:35,847 INFO L273 TraceCheckUtils]: 21: Hoare triple {6688#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6689#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:35,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {6689#(<= main_~i~0 8)} assume true; {6689#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:35,850 INFO L273 TraceCheckUtils]: 23: Hoare triple {6689#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6690#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:35,850 INFO L273 TraceCheckUtils]: 24: Hoare triple {6690#(<= main_~i~0 9)} assume true; {6690#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:35,851 INFO L273 TraceCheckUtils]: 25: Hoare triple {6690#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6691#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:35,851 INFO L273 TraceCheckUtils]: 26: Hoare triple {6691#(<= main_~i~0 10)} assume true; {6691#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:35,852 INFO L273 TraceCheckUtils]: 27: Hoare triple {6691#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6692#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:35,852 INFO L273 TraceCheckUtils]: 28: Hoare triple {6692#(<= main_~i~0 11)} assume true; {6692#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:35,853 INFO L273 TraceCheckUtils]: 29: Hoare triple {6692#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6693#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:35,853 INFO L273 TraceCheckUtils]: 30: Hoare triple {6693#(<= main_~i~0 12)} assume true; {6693#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:35,854 INFO L273 TraceCheckUtils]: 31: Hoare triple {6693#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6694#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:35,855 INFO L273 TraceCheckUtils]: 32: Hoare triple {6694#(<= main_~i~0 13)} assume true; {6694#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:35,856 INFO L273 TraceCheckUtils]: 33: Hoare triple {6694#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6695#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:35,856 INFO L273 TraceCheckUtils]: 34: Hoare triple {6695#(<= main_~i~0 14)} assume true; {6695#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:35,857 INFO L273 TraceCheckUtils]: 35: Hoare triple {6695#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6696#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:35,858 INFO L273 TraceCheckUtils]: 36: Hoare triple {6696#(<= main_~i~0 15)} assume true; {6696#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:35,859 INFO L273 TraceCheckUtils]: 37: Hoare triple {6696#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6697#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:35,860 INFO L273 TraceCheckUtils]: 38: Hoare triple {6697#(<= main_~i~0 16)} assume true; {6697#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:35,861 INFO L273 TraceCheckUtils]: 39: Hoare triple {6697#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6698#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:35,861 INFO L273 TraceCheckUtils]: 40: Hoare triple {6698#(<= main_~i~0 17)} assume true; {6698#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:35,862 INFO L273 TraceCheckUtils]: 41: Hoare triple {6698#(<= main_~i~0 17)} assume !(~i~0 < 100000); {6680#false} is VALID [2018-11-14 18:46:35,862 INFO L273 TraceCheckUtils]: 42: Hoare triple {6680#false} ~i~0 := 1; {6680#false} is VALID [2018-11-14 18:46:35,862 INFO L273 TraceCheckUtils]: 43: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,862 INFO L273 TraceCheckUtils]: 44: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,863 INFO L273 TraceCheckUtils]: 45: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,863 INFO L273 TraceCheckUtils]: 46: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,863 INFO L273 TraceCheckUtils]: 47: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,863 INFO L273 TraceCheckUtils]: 48: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,863 INFO L273 TraceCheckUtils]: 49: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,864 INFO L273 TraceCheckUtils]: 50: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,864 INFO L273 TraceCheckUtils]: 51: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,864 INFO L273 TraceCheckUtils]: 52: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,864 INFO L273 TraceCheckUtils]: 53: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,865 INFO L273 TraceCheckUtils]: 54: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,865 INFO L273 TraceCheckUtils]: 55: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,865 INFO L273 TraceCheckUtils]: 56: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,865 INFO L273 TraceCheckUtils]: 57: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,865 INFO L273 TraceCheckUtils]: 58: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {6680#false} is VALID [2018-11-14 18:46:35,865 INFO L273 TraceCheckUtils]: 59: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,865 INFO L273 TraceCheckUtils]: 60: Hoare triple {6680#false} assume !(~i~0 < 100000); {6680#false} is VALID [2018-11-14 18:46:35,865 INFO L273 TraceCheckUtils]: 61: Hoare triple {6680#false} ~i~0 := 1;~j~0 := 0; {6680#false} is VALID [2018-11-14 18:46:35,866 INFO L273 TraceCheckUtils]: 62: Hoare triple {6680#false} assume true; {6680#false} is VALID [2018-11-14 18:46:35,866 INFO L273 TraceCheckUtils]: 63: Hoare triple {6680#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {6680#false} is VALID [2018-11-14 18:46:35,866 INFO L256 TraceCheckUtils]: 64: Hoare triple {6680#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6680#false} is VALID [2018-11-14 18:46:35,866 INFO L273 TraceCheckUtils]: 65: Hoare triple {6680#false} ~cond := #in~cond; {6680#false} is VALID [2018-11-14 18:46:35,866 INFO L273 TraceCheckUtils]: 66: Hoare triple {6680#false} assume ~cond == 0; {6680#false} is VALID [2018-11-14 18:46:35,866 INFO L273 TraceCheckUtils]: 67: Hoare triple {6680#false} assume !false; {6680#false} is VALID [2018-11-14 18:46:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-14 18:46:35,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:35,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 18:46:35,889 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-11-14 18:46:35,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:35,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 18:46:35,942 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-14 18:46:35,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 18:46:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 18:46:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:46:35,944 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 21 states. [2018-11-14 18:46:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:37,236 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2018-11-14 18:46:37,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 18:46:37,236 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-11-14 18:46:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:46:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 140 transitions. [2018-11-14 18:46:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:46:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 140 transitions. [2018-11-14 18:46:37,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 140 transitions. [2018-11-14 18:46:37,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:37,844 INFO L225 Difference]: With dead ends: 142 [2018-11-14 18:46:37,844 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 18:46:37,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:46:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 18:46:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 76. [2018-11-14 18:46:38,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:38,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 76 states. [2018-11-14 18:46:38,004 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 76 states. [2018-11-14 18:46:38,004 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 76 states. [2018-11-14 18:46:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:38,007 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-11-14 18:46:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2018-11-14 18:46:38,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:38,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:38,008 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 112 states. [2018-11-14 18:46:38,009 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 112 states. [2018-11-14 18:46:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:38,012 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-11-14 18:46:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2018-11-14 18:46:38,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:38,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:38,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:38,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 18:46:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-11-14 18:46:38,015 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 68 [2018-11-14 18:46:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:38,015 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-14 18:46:38,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 18:46:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-14 18:46:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-14 18:46:38,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:38,016 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:38,017 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:38,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:38,017 INFO L82 PathProgramCache]: Analyzing trace with hash -737872061, now seen corresponding path program 15 times [2018-11-14 18:46:38,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:38,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:38,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:38,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {7447#true} call ULTIMATE.init(); {7447#true} is VALID [2018-11-14 18:46:38,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {7447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7447#true} is VALID [2018-11-14 18:46:38,777 INFO L273 TraceCheckUtils]: 2: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:38,777 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7447#true} {7447#true} #63#return; {7447#true} is VALID [2018-11-14 18:46:38,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {7447#true} call #t~ret4 := main(); {7447#true} is VALID [2018-11-14 18:46:38,778 INFO L273 TraceCheckUtils]: 5: Hoare triple {7447#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; {7449#(= main_~i~0 0)} is VALID [2018-11-14 18:46:38,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {7449#(= main_~i~0 0)} assume true; {7449#(= main_~i~0 0)} is VALID [2018-11-14 18:46:38,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {7449#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7450#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:38,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {7450#(<= main_~i~0 1)} assume true; {7450#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:38,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {7450#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7451#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:38,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {7451#(<= main_~i~0 2)} assume true; {7451#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:38,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {7451#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7452#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:38,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {7452#(<= main_~i~0 3)} assume true; {7452#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:38,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {7452#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7453#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:38,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {7453#(<= main_~i~0 4)} assume true; {7453#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:38,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {7453#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7454#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:38,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {7454#(<= main_~i~0 5)} assume true; {7454#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:38,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {7454#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7455#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:38,833 INFO L273 TraceCheckUtils]: 18: Hoare triple {7455#(<= main_~i~0 6)} assume true; {7455#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:38,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {7455#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7456#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:38,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {7456#(<= main_~i~0 7)} assume true; {7456#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:38,835 INFO L273 TraceCheckUtils]: 21: Hoare triple {7456#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7457#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:38,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {7457#(<= main_~i~0 8)} assume true; {7457#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:38,836 INFO L273 TraceCheckUtils]: 23: Hoare triple {7457#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7458#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:38,836 INFO L273 TraceCheckUtils]: 24: Hoare triple {7458#(<= main_~i~0 9)} assume true; {7458#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:38,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {7458#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7459#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:38,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {7459#(<= main_~i~0 10)} assume true; {7459#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:38,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {7459#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7460#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:38,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {7460#(<= main_~i~0 11)} assume true; {7460#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:38,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {7460#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7461#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:38,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {7461#(<= main_~i~0 12)} assume true; {7461#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:38,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {7461#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7462#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:38,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {7462#(<= main_~i~0 13)} assume true; {7462#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:38,843 INFO L273 TraceCheckUtils]: 33: Hoare triple {7462#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7463#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:38,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {7463#(<= main_~i~0 14)} assume true; {7463#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:38,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {7463#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7464#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:38,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {7464#(<= main_~i~0 15)} assume true; {7464#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:38,845 INFO L273 TraceCheckUtils]: 37: Hoare triple {7464#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7465#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:38,846 INFO L273 TraceCheckUtils]: 38: Hoare triple {7465#(<= main_~i~0 16)} assume true; {7465#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:38,847 INFO L273 TraceCheckUtils]: 39: Hoare triple {7465#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7466#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:38,847 INFO L273 TraceCheckUtils]: 40: Hoare triple {7466#(<= main_~i~0 17)} assume true; {7466#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:38,848 INFO L273 TraceCheckUtils]: 41: Hoare triple {7466#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7467#(<= main_~i~0 18)} is VALID [2018-11-14 18:46:38,849 INFO L273 TraceCheckUtils]: 42: Hoare triple {7467#(<= main_~i~0 18)} assume true; {7467#(<= main_~i~0 18)} is VALID [2018-11-14 18:46:38,849 INFO L273 TraceCheckUtils]: 43: Hoare triple {7467#(<= main_~i~0 18)} assume !(~i~0 < 100000); {7448#false} is VALID [2018-11-14 18:46:38,850 INFO L273 TraceCheckUtils]: 44: Hoare triple {7448#false} ~i~0 := 1; {7448#false} is VALID [2018-11-14 18:46:38,850 INFO L273 TraceCheckUtils]: 45: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:46:38,850 INFO L273 TraceCheckUtils]: 46: Hoare triple {7448#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7448#false} is VALID [2018-11-14 18:46:38,850 INFO L273 TraceCheckUtils]: 47: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:46:38,851 INFO L273 TraceCheckUtils]: 48: Hoare triple {7448#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7448#false} is VALID [2018-11-14 18:46:38,851 INFO L273 TraceCheckUtils]: 49: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:46:38,851 INFO L273 TraceCheckUtils]: 50: Hoare triple {7448#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7448#false} is VALID [2018-11-14 18:46:38,851 INFO L273 TraceCheckUtils]: 51: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:46:38,851 INFO L273 TraceCheckUtils]: 52: Hoare triple {7448#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7448#false} is VALID [2018-11-14 18:46:38,852 INFO L273 TraceCheckUtils]: 53: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:46:38,852 INFO L273 TraceCheckUtils]: 54: Hoare triple {7448#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7448#false} is VALID [2018-11-14 18:46:38,852 INFO L273 TraceCheckUtils]: 55: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:46:38,852 INFO L273 TraceCheckUtils]: 56: Hoare triple {7448#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7448#false} is VALID [2018-11-14 18:46:38,852 INFO L273 TraceCheckUtils]: 57: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:46:38,853 INFO L273 TraceCheckUtils]: 58: Hoare triple {7448#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7448#false} is VALID [2018-11-14 18:46:38,853 INFO L273 TraceCheckUtils]: 59: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:46:38,853 INFO L273 TraceCheckUtils]: 60: Hoare triple {7448#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7448#false} is VALID [2018-11-14 18:46:38,853 INFO L273 TraceCheckUtils]: 61: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:46:38,853 INFO L273 TraceCheckUtils]: 62: Hoare triple {7448#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7448#false} is VALID [2018-11-14 18:46:38,853 INFO L273 TraceCheckUtils]: 63: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:46:38,854 INFO L273 TraceCheckUtils]: 64: Hoare triple {7448#false} assume !(~i~0 < 100000); {7448#false} is VALID [2018-11-14 18:46:38,854 INFO L273 TraceCheckUtils]: 65: Hoare triple {7448#false} ~i~0 := 1;~j~0 := 0; {7448#false} is VALID [2018-11-14 18:46:38,854 INFO L273 TraceCheckUtils]: 66: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:46:38,854 INFO L273 TraceCheckUtils]: 67: Hoare triple {7448#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {7448#false} is VALID [2018-11-14 18:46:38,854 INFO L256 TraceCheckUtils]: 68: Hoare triple {7448#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7448#false} is VALID [2018-11-14 18:46:38,854 INFO L273 TraceCheckUtils]: 69: Hoare triple {7448#false} ~cond := #in~cond; {7448#false} is VALID [2018-11-14 18:46:38,855 INFO L273 TraceCheckUtils]: 70: Hoare triple {7448#false} assume ~cond == 0; {7448#false} is VALID [2018-11-14 18:46:38,855 INFO L273 TraceCheckUtils]: 71: Hoare triple {7448#false} assume !false; {7448#false} is VALID [2018-11-14 18:46:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-14 18:46:38,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:38,859 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-14 18:46:38,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:46:39,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 18:46:39,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:39,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:39,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {7447#true} call ULTIMATE.init(); {7447#true} is VALID [2018-11-14 18:46:39,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {7447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7447#true} is VALID [2018-11-14 18:46:39,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7447#true} {7447#true} #63#return; {7447#true} is VALID [2018-11-14 18:46:39,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {7447#true} call #t~ret4 := main(); {7447#true} is VALID [2018-11-14 18:46:39,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {7447#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; {7447#true} is VALID [2018-11-14 18:46:39,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,668 INFO L273 TraceCheckUtils]: 8: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,669 INFO L273 TraceCheckUtils]: 17: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,670 INFO L273 TraceCheckUtils]: 21: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,670 INFO L273 TraceCheckUtils]: 22: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,670 INFO L273 TraceCheckUtils]: 23: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,670 INFO L273 TraceCheckUtils]: 25: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,670 INFO L273 TraceCheckUtils]: 26: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,671 INFO L273 TraceCheckUtils]: 27: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,671 INFO L273 TraceCheckUtils]: 28: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,671 INFO L273 TraceCheckUtils]: 29: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,671 INFO L273 TraceCheckUtils]: 30: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,671 INFO L273 TraceCheckUtils]: 31: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,671 INFO L273 TraceCheckUtils]: 32: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,671 INFO L273 TraceCheckUtils]: 33: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,671 INFO L273 TraceCheckUtils]: 34: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,672 INFO L273 TraceCheckUtils]: 35: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,672 INFO L273 TraceCheckUtils]: 36: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,672 INFO L273 TraceCheckUtils]: 37: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,672 INFO L273 TraceCheckUtils]: 38: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,672 INFO L273 TraceCheckUtils]: 39: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,672 INFO L273 TraceCheckUtils]: 40: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,672 INFO L273 TraceCheckUtils]: 41: Hoare triple {7447#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7447#true} is VALID [2018-11-14 18:46:39,672 INFO L273 TraceCheckUtils]: 42: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:46:39,672 INFO L273 TraceCheckUtils]: 43: Hoare triple {7447#true} assume !(~i~0 < 100000); {7447#true} is VALID [2018-11-14 18:46:39,673 INFO L273 TraceCheckUtils]: 44: Hoare triple {7447#true} ~i~0 := 1; {7450#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:39,673 INFO L273 TraceCheckUtils]: 45: Hoare triple {7450#(<= main_~i~0 1)} assume true; {7450#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:39,674 INFO L273 TraceCheckUtils]: 46: Hoare triple {7450#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7452#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:39,674 INFO L273 TraceCheckUtils]: 47: Hoare triple {7452#(<= main_~i~0 3)} assume true; {7452#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:39,675 INFO L273 TraceCheckUtils]: 48: Hoare triple {7452#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7454#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:39,675 INFO L273 TraceCheckUtils]: 49: Hoare triple {7454#(<= main_~i~0 5)} assume true; {7454#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:39,676 INFO L273 TraceCheckUtils]: 50: Hoare triple {7454#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7456#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:39,676 INFO L273 TraceCheckUtils]: 51: Hoare triple {7456#(<= main_~i~0 7)} assume true; {7456#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:39,677 INFO L273 TraceCheckUtils]: 52: Hoare triple {7456#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7458#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:39,678 INFO L273 TraceCheckUtils]: 53: Hoare triple {7458#(<= main_~i~0 9)} assume true; {7458#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:39,679 INFO L273 TraceCheckUtils]: 54: Hoare triple {7458#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7460#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:39,679 INFO L273 TraceCheckUtils]: 55: Hoare triple {7460#(<= main_~i~0 11)} assume true; {7460#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:39,680 INFO L273 TraceCheckUtils]: 56: Hoare triple {7460#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7462#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:39,681 INFO L273 TraceCheckUtils]: 57: Hoare triple {7462#(<= main_~i~0 13)} assume true; {7462#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:39,682 INFO L273 TraceCheckUtils]: 58: Hoare triple {7462#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7464#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:39,682 INFO L273 TraceCheckUtils]: 59: Hoare triple {7464#(<= main_~i~0 15)} assume true; {7464#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:39,683 INFO L273 TraceCheckUtils]: 60: Hoare triple {7464#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7466#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:39,684 INFO L273 TraceCheckUtils]: 61: Hoare triple {7466#(<= main_~i~0 17)} assume true; {7466#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:39,685 INFO L273 TraceCheckUtils]: 62: Hoare triple {7466#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {7657#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:39,685 INFO L273 TraceCheckUtils]: 63: Hoare triple {7657#(<= main_~i~0 19)} assume true; {7657#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:39,686 INFO L273 TraceCheckUtils]: 64: Hoare triple {7657#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7448#false} is VALID [2018-11-14 18:46:39,686 INFO L273 TraceCheckUtils]: 65: Hoare triple {7448#false} ~i~0 := 1;~j~0 := 0; {7448#false} is VALID [2018-11-14 18:46:39,687 INFO L273 TraceCheckUtils]: 66: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:46:39,687 INFO L273 TraceCheckUtils]: 67: Hoare triple {7448#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {7448#false} is VALID [2018-11-14 18:46:39,687 INFO L256 TraceCheckUtils]: 68: Hoare triple {7448#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7448#false} is VALID [2018-11-14 18:46:39,687 INFO L273 TraceCheckUtils]: 69: Hoare triple {7448#false} ~cond := #in~cond; {7448#false} is VALID [2018-11-14 18:46:39,687 INFO L273 TraceCheckUtils]: 70: Hoare triple {7448#false} assume ~cond == 0; {7448#false} is VALID [2018-11-14 18:46:39,688 INFO L273 TraceCheckUtils]: 71: Hoare triple {7448#false} assume !false; {7448#false} is VALID [2018-11-14 18:46:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-14 18:46:39,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:39,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 22 [2018-11-14 18:46:39,712 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-11-14 18:46:39,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:39,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 18:46:39,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:39,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 18:46:39,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 18:46:39,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:46:39,787 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 22 states. [2018-11-14 18:46:40,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:40,697 INFO L93 Difference]: Finished difference Result 154 states and 170 transitions. [2018-11-14 18:46:40,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 18:46:40,698 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-11-14 18:46:40,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:46:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 152 transitions. [2018-11-14 18:46:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:46:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 152 transitions. [2018-11-14 18:46:40,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 152 transitions. [2018-11-14 18:46:40,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:40,856 INFO L225 Difference]: With dead ends: 154 [2018-11-14 18:46:40,856 INFO L226 Difference]: Without dead ends: 122 [2018-11-14 18:46:40,857 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:46:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-14 18:46:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2018-11-14 18:46:40,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:40,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 82 states. [2018-11-14 18:46:40,884 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 82 states. [2018-11-14 18:46:40,884 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 82 states. [2018-11-14 18:46:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:40,889 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2018-11-14 18:46:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-11-14 18:46:40,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:40,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:40,890 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 122 states. [2018-11-14 18:46:40,890 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 122 states. [2018-11-14 18:46:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:40,893 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2018-11-14 18:46:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-11-14 18:46:40,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:40,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:40,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:40,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 18:46:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-14 18:46:40,896 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 72 [2018-11-14 18:46:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:40,896 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-14 18:46:40,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 18:46:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-14 18:46:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-14 18:46:40,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:40,897 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:40,897 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:40,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1440044969, now seen corresponding path program 16 times [2018-11-14 18:46:40,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:40,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:40,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:40,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:40,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:41,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {8275#true} call ULTIMATE.init(); {8275#true} is VALID [2018-11-14 18:46:41,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {8275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8275#true} is VALID [2018-11-14 18:46:41,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {8275#true} assume true; {8275#true} is VALID [2018-11-14 18:46:41,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8275#true} {8275#true} #63#return; {8275#true} is VALID [2018-11-14 18:46:41,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {8275#true} call #t~ret4 := main(); {8275#true} is VALID [2018-11-14 18:46:41,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {8275#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; {8277#(= main_~i~0 0)} is VALID [2018-11-14 18:46:41,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {8277#(= main_~i~0 0)} assume true; {8277#(= main_~i~0 0)} is VALID [2018-11-14 18:46:41,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {8277#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8278#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:41,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {8278#(<= main_~i~0 1)} assume true; {8278#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:41,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {8278#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8279#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:41,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {8279#(<= main_~i~0 2)} assume true; {8279#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:41,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {8279#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8280#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:41,353 INFO L273 TraceCheckUtils]: 12: Hoare triple {8280#(<= main_~i~0 3)} assume true; {8280#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:41,354 INFO L273 TraceCheckUtils]: 13: Hoare triple {8280#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8281#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:41,354 INFO L273 TraceCheckUtils]: 14: Hoare triple {8281#(<= main_~i~0 4)} assume true; {8281#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:41,355 INFO L273 TraceCheckUtils]: 15: Hoare triple {8281#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8282#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:41,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {8282#(<= main_~i~0 5)} assume true; {8282#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:41,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {8282#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8283#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:41,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {8283#(<= main_~i~0 6)} assume true; {8283#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:41,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {8283#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8284#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:41,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {8284#(<= main_~i~0 7)} assume true; {8284#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:41,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {8284#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8285#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:41,360 INFO L273 TraceCheckUtils]: 22: Hoare triple {8285#(<= main_~i~0 8)} assume true; {8285#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:41,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {8285#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8286#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:41,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {8286#(<= main_~i~0 9)} assume true; {8286#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:41,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {8286#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8287#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:41,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {8287#(<= main_~i~0 10)} assume true; {8287#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:41,364 INFO L273 TraceCheckUtils]: 27: Hoare triple {8287#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8288#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:41,364 INFO L273 TraceCheckUtils]: 28: Hoare triple {8288#(<= main_~i~0 11)} assume true; {8288#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:41,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {8288#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8289#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:41,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {8289#(<= main_~i~0 12)} assume true; {8289#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:41,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {8289#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8290#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:41,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {8290#(<= main_~i~0 13)} assume true; {8290#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:41,368 INFO L273 TraceCheckUtils]: 33: Hoare triple {8290#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8291#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:41,369 INFO L273 TraceCheckUtils]: 34: Hoare triple {8291#(<= main_~i~0 14)} assume true; {8291#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:41,370 INFO L273 TraceCheckUtils]: 35: Hoare triple {8291#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8292#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:41,371 INFO L273 TraceCheckUtils]: 36: Hoare triple {8292#(<= main_~i~0 15)} assume true; {8292#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:41,371 INFO L273 TraceCheckUtils]: 37: Hoare triple {8292#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8293#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:41,372 INFO L273 TraceCheckUtils]: 38: Hoare triple {8293#(<= main_~i~0 16)} assume true; {8293#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:41,373 INFO L273 TraceCheckUtils]: 39: Hoare triple {8293#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8294#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:41,374 INFO L273 TraceCheckUtils]: 40: Hoare triple {8294#(<= main_~i~0 17)} assume true; {8294#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:41,374 INFO L273 TraceCheckUtils]: 41: Hoare triple {8294#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8295#(<= main_~i~0 18)} is VALID [2018-11-14 18:46:41,375 INFO L273 TraceCheckUtils]: 42: Hoare triple {8295#(<= main_~i~0 18)} assume true; {8295#(<= main_~i~0 18)} is VALID [2018-11-14 18:46:41,398 INFO L273 TraceCheckUtils]: 43: Hoare triple {8295#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8296#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:41,399 INFO L273 TraceCheckUtils]: 44: Hoare triple {8296#(<= main_~i~0 19)} assume true; {8296#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:41,399 INFO L273 TraceCheckUtils]: 45: Hoare triple {8296#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8297#(<= main_~i~0 20)} is VALID [2018-11-14 18:46:41,400 INFO L273 TraceCheckUtils]: 46: Hoare triple {8297#(<= main_~i~0 20)} assume true; {8297#(<= main_~i~0 20)} is VALID [2018-11-14 18:46:41,400 INFO L273 TraceCheckUtils]: 47: Hoare triple {8297#(<= main_~i~0 20)} assume !(~i~0 < 100000); {8276#false} is VALID [2018-11-14 18:46:41,400 INFO L273 TraceCheckUtils]: 48: Hoare triple {8276#false} ~i~0 := 1; {8276#false} is VALID [2018-11-14 18:46:41,400 INFO L273 TraceCheckUtils]: 49: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,400 INFO L273 TraceCheckUtils]: 50: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,400 INFO L273 TraceCheckUtils]: 51: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,401 INFO L273 TraceCheckUtils]: 52: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,401 INFO L273 TraceCheckUtils]: 53: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,401 INFO L273 TraceCheckUtils]: 54: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,401 INFO L273 TraceCheckUtils]: 55: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,401 INFO L273 TraceCheckUtils]: 56: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,401 INFO L273 TraceCheckUtils]: 57: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,401 INFO L273 TraceCheckUtils]: 58: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,402 INFO L273 TraceCheckUtils]: 59: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,402 INFO L273 TraceCheckUtils]: 60: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,402 INFO L273 TraceCheckUtils]: 61: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,402 INFO L273 TraceCheckUtils]: 62: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,402 INFO L273 TraceCheckUtils]: 63: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,403 INFO L273 TraceCheckUtils]: 64: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,403 INFO L273 TraceCheckUtils]: 65: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,403 INFO L273 TraceCheckUtils]: 66: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,403 INFO L273 TraceCheckUtils]: 67: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,403 INFO L273 TraceCheckUtils]: 68: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,403 INFO L273 TraceCheckUtils]: 69: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,404 INFO L273 TraceCheckUtils]: 70: Hoare triple {8276#false} assume !(~i~0 < 100000); {8276#false} is VALID [2018-11-14 18:46:41,404 INFO L273 TraceCheckUtils]: 71: Hoare triple {8276#false} ~i~0 := 1;~j~0 := 0; {8276#false} is VALID [2018-11-14 18:46:41,404 INFO L273 TraceCheckUtils]: 72: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,404 INFO L273 TraceCheckUtils]: 73: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {8276#false} is VALID [2018-11-14 18:46:41,404 INFO L256 TraceCheckUtils]: 74: Hoare triple {8276#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8276#false} is VALID [2018-11-14 18:46:41,404 INFO L273 TraceCheckUtils]: 75: Hoare triple {8276#false} ~cond := #in~cond; {8276#false} is VALID [2018-11-14 18:46:41,404 INFO L273 TraceCheckUtils]: 76: Hoare triple {8276#false} assume ~cond == 0; {8276#false} is VALID [2018-11-14 18:46:41,404 INFO L273 TraceCheckUtils]: 77: Hoare triple {8276#false} assume !false; {8276#false} is VALID [2018-11-14 18:46:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-14 18:46:41,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:41,408 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-14 18:46:41,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:46:41,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:46:41,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:41,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:41,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {8275#true} call ULTIMATE.init(); {8275#true} is VALID [2018-11-14 18:46:41,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {8275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8275#true} is VALID [2018-11-14 18:46:41,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {8275#true} assume true; {8275#true} is VALID [2018-11-14 18:46:41,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8275#true} {8275#true} #63#return; {8275#true} is VALID [2018-11-14 18:46:41,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {8275#true} call #t~ret4 := main(); {8275#true} is VALID [2018-11-14 18:46:41,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {8275#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; {8316#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:41,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {8316#(<= main_~i~0 0)} assume true; {8316#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:41,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {8316#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8278#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:41,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {8278#(<= main_~i~0 1)} assume true; {8278#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:41,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {8278#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8279#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:41,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {8279#(<= main_~i~0 2)} assume true; {8279#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:41,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {8279#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8280#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:41,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {8280#(<= main_~i~0 3)} assume true; {8280#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:41,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {8280#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8281#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:41,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {8281#(<= main_~i~0 4)} assume true; {8281#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:41,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {8281#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8282#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:41,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {8282#(<= main_~i~0 5)} assume true; {8282#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:41,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {8282#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8283#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:41,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {8283#(<= main_~i~0 6)} assume true; {8283#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:41,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {8283#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8284#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:41,726 INFO L273 TraceCheckUtils]: 20: Hoare triple {8284#(<= main_~i~0 7)} assume true; {8284#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:41,727 INFO L273 TraceCheckUtils]: 21: Hoare triple {8284#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8285#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:41,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {8285#(<= main_~i~0 8)} assume true; {8285#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:41,729 INFO L273 TraceCheckUtils]: 23: Hoare triple {8285#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8286#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:41,729 INFO L273 TraceCheckUtils]: 24: Hoare triple {8286#(<= main_~i~0 9)} assume true; {8286#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:41,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {8286#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8287#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:41,731 INFO L273 TraceCheckUtils]: 26: Hoare triple {8287#(<= main_~i~0 10)} assume true; {8287#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:41,732 INFO L273 TraceCheckUtils]: 27: Hoare triple {8287#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8288#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:41,732 INFO L273 TraceCheckUtils]: 28: Hoare triple {8288#(<= main_~i~0 11)} assume true; {8288#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:41,733 INFO L273 TraceCheckUtils]: 29: Hoare triple {8288#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8289#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:41,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {8289#(<= main_~i~0 12)} assume true; {8289#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:41,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {8289#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8290#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:41,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {8290#(<= main_~i~0 13)} assume true; {8290#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:41,736 INFO L273 TraceCheckUtils]: 33: Hoare triple {8290#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8291#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:41,737 INFO L273 TraceCheckUtils]: 34: Hoare triple {8291#(<= main_~i~0 14)} assume true; {8291#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:41,738 INFO L273 TraceCheckUtils]: 35: Hoare triple {8291#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8292#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:41,738 INFO L273 TraceCheckUtils]: 36: Hoare triple {8292#(<= main_~i~0 15)} assume true; {8292#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:41,739 INFO L273 TraceCheckUtils]: 37: Hoare triple {8292#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8293#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:41,740 INFO L273 TraceCheckUtils]: 38: Hoare triple {8293#(<= main_~i~0 16)} assume true; {8293#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:41,741 INFO L273 TraceCheckUtils]: 39: Hoare triple {8293#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8294#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:41,741 INFO L273 TraceCheckUtils]: 40: Hoare triple {8294#(<= main_~i~0 17)} assume true; {8294#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:41,742 INFO L273 TraceCheckUtils]: 41: Hoare triple {8294#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8295#(<= main_~i~0 18)} is VALID [2018-11-14 18:46:41,743 INFO L273 TraceCheckUtils]: 42: Hoare triple {8295#(<= main_~i~0 18)} assume true; {8295#(<= main_~i~0 18)} is VALID [2018-11-14 18:46:41,744 INFO L273 TraceCheckUtils]: 43: Hoare triple {8295#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8296#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:41,744 INFO L273 TraceCheckUtils]: 44: Hoare triple {8296#(<= main_~i~0 19)} assume true; {8296#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:41,745 INFO L273 TraceCheckUtils]: 45: Hoare triple {8296#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8297#(<= main_~i~0 20)} is VALID [2018-11-14 18:46:41,746 INFO L273 TraceCheckUtils]: 46: Hoare triple {8297#(<= main_~i~0 20)} assume true; {8297#(<= main_~i~0 20)} is VALID [2018-11-14 18:46:41,747 INFO L273 TraceCheckUtils]: 47: Hoare triple {8297#(<= main_~i~0 20)} assume !(~i~0 < 100000); {8276#false} is VALID [2018-11-14 18:46:41,747 INFO L273 TraceCheckUtils]: 48: Hoare triple {8276#false} ~i~0 := 1; {8276#false} is VALID [2018-11-14 18:46:41,747 INFO L273 TraceCheckUtils]: 49: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,747 INFO L273 TraceCheckUtils]: 50: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,747 INFO L273 TraceCheckUtils]: 51: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,748 INFO L273 TraceCheckUtils]: 52: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,748 INFO L273 TraceCheckUtils]: 53: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,748 INFO L273 TraceCheckUtils]: 54: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,748 INFO L273 TraceCheckUtils]: 55: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,748 INFO L273 TraceCheckUtils]: 56: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,749 INFO L273 TraceCheckUtils]: 57: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,749 INFO L273 TraceCheckUtils]: 58: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,749 INFO L273 TraceCheckUtils]: 59: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,749 INFO L273 TraceCheckUtils]: 60: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,749 INFO L273 TraceCheckUtils]: 61: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,750 INFO L273 TraceCheckUtils]: 62: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,750 INFO L273 TraceCheckUtils]: 63: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,750 INFO L273 TraceCheckUtils]: 64: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,750 INFO L273 TraceCheckUtils]: 65: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,750 INFO L273 TraceCheckUtils]: 66: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,750 INFO L273 TraceCheckUtils]: 67: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,750 INFO L273 TraceCheckUtils]: 68: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {8276#false} is VALID [2018-11-14 18:46:41,751 INFO L273 TraceCheckUtils]: 69: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,751 INFO L273 TraceCheckUtils]: 70: Hoare triple {8276#false} assume !(~i~0 < 100000); {8276#false} is VALID [2018-11-14 18:46:41,751 INFO L273 TraceCheckUtils]: 71: Hoare triple {8276#false} ~i~0 := 1;~j~0 := 0; {8276#false} is VALID [2018-11-14 18:46:41,751 INFO L273 TraceCheckUtils]: 72: Hoare triple {8276#false} assume true; {8276#false} is VALID [2018-11-14 18:46:41,751 INFO L273 TraceCheckUtils]: 73: Hoare triple {8276#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {8276#false} is VALID [2018-11-14 18:46:41,751 INFO L256 TraceCheckUtils]: 74: Hoare triple {8276#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8276#false} is VALID [2018-11-14 18:46:41,751 INFO L273 TraceCheckUtils]: 75: Hoare triple {8276#false} ~cond := #in~cond; {8276#false} is VALID [2018-11-14 18:46:41,751 INFO L273 TraceCheckUtils]: 76: Hoare triple {8276#false} assume ~cond == 0; {8276#false} is VALID [2018-11-14 18:46:41,751 INFO L273 TraceCheckUtils]: 77: Hoare triple {8276#false} assume !false; {8276#false} is VALID [2018-11-14 18:46:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-14 18:46:41,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:41,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 18:46:41,775 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 78 [2018-11-14 18:46:41,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:41,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:46:41,834 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-14 18:46:41,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:46:41,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:46:41,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:46:41,836 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 24 states. [2018-11-14 18:46:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:42,781 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2018-11-14 18:46:42,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 18:46:42,782 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 78 [2018-11-14 18:46:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:46:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 152 transitions. [2018-11-14 18:46:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:46:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 152 transitions. [2018-11-14 18:46:42,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 152 transitions. [2018-11-14 18:46:42,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:42,931 INFO L225 Difference]: With dead ends: 158 [2018-11-14 18:46:42,931 INFO L226 Difference]: Without dead ends: 124 [2018-11-14 18:46:42,932 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:46:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-14 18:46:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2018-11-14 18:46:42,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:42,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 84 states. [2018-11-14 18:46:42,970 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 84 states. [2018-11-14 18:46:42,970 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 84 states. [2018-11-14 18:46:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:42,973 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-11-14 18:46:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-11-14 18:46:42,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:42,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:42,974 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 124 states. [2018-11-14 18:46:42,975 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 124 states. [2018-11-14 18:46:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:42,977 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-11-14 18:46:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-11-14 18:46:42,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:42,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:42,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:42,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-14 18:46:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-11-14 18:46:42,980 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 78 [2018-11-14 18:46:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:42,981 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-11-14 18:46:42,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:46:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-11-14 18:46:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-14 18:46:42,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:42,982 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:42,982 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:42,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:42,983 INFO L82 PathProgramCache]: Analyzing trace with hash -737599153, now seen corresponding path program 17 times [2018-11-14 18:46:42,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:42,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:42,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:43,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {9136#true} call ULTIMATE.init(); {9136#true} is VALID [2018-11-14 18:46:43,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {9136#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9136#true} is VALID [2018-11-14 18:46:43,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:46:43,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9136#true} {9136#true} #63#return; {9136#true} is VALID [2018-11-14 18:46:43,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {9136#true} call #t~ret4 := main(); {9136#true} is VALID [2018-11-14 18:46:43,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {9136#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; {9138#(= main_~i~0 0)} is VALID [2018-11-14 18:46:43,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {9138#(= main_~i~0 0)} assume true; {9138#(= main_~i~0 0)} is VALID [2018-11-14 18:46:43,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {9138#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9139#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:43,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {9139#(<= main_~i~0 1)} assume true; {9139#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:43,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {9139#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9140#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:43,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {9140#(<= main_~i~0 2)} assume true; {9140#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:43,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {9140#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9141#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:43,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {9141#(<= main_~i~0 3)} assume true; {9141#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:43,681 INFO L273 TraceCheckUtils]: 13: Hoare triple {9141#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9142#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:43,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {9142#(<= main_~i~0 4)} assume true; {9142#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:43,682 INFO L273 TraceCheckUtils]: 15: Hoare triple {9142#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9143#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:43,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {9143#(<= main_~i~0 5)} assume true; {9143#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:43,684 INFO L273 TraceCheckUtils]: 17: Hoare triple {9143#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9144#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:43,684 INFO L273 TraceCheckUtils]: 18: Hoare triple {9144#(<= main_~i~0 6)} assume true; {9144#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:43,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {9144#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9145#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:43,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {9145#(<= main_~i~0 7)} assume true; {9145#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:43,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {9145#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9146#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:43,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {9146#(<= main_~i~0 8)} assume true; {9146#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:43,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {9146#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9147#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:43,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {9147#(<= main_~i~0 9)} assume true; {9147#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:43,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {9147#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9148#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:43,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {9148#(<= main_~i~0 10)} assume true; {9148#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:43,691 INFO L273 TraceCheckUtils]: 27: Hoare triple {9148#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9149#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:43,692 INFO L273 TraceCheckUtils]: 28: Hoare triple {9149#(<= main_~i~0 11)} assume true; {9149#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:43,693 INFO L273 TraceCheckUtils]: 29: Hoare triple {9149#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9150#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:43,693 INFO L273 TraceCheckUtils]: 30: Hoare triple {9150#(<= main_~i~0 12)} assume true; {9150#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:43,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {9150#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9151#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:43,695 INFO L273 TraceCheckUtils]: 32: Hoare triple {9151#(<= main_~i~0 13)} assume true; {9151#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:43,696 INFO L273 TraceCheckUtils]: 33: Hoare triple {9151#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9152#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:43,696 INFO L273 TraceCheckUtils]: 34: Hoare triple {9152#(<= main_~i~0 14)} assume true; {9152#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:43,697 INFO L273 TraceCheckUtils]: 35: Hoare triple {9152#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9153#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:43,698 INFO L273 TraceCheckUtils]: 36: Hoare triple {9153#(<= main_~i~0 15)} assume true; {9153#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:43,699 INFO L273 TraceCheckUtils]: 37: Hoare triple {9153#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9154#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:43,699 INFO L273 TraceCheckUtils]: 38: Hoare triple {9154#(<= main_~i~0 16)} assume true; {9154#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:43,700 INFO L273 TraceCheckUtils]: 39: Hoare triple {9154#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9155#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:43,701 INFO L273 TraceCheckUtils]: 40: Hoare triple {9155#(<= main_~i~0 17)} assume true; {9155#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:43,702 INFO L273 TraceCheckUtils]: 41: Hoare triple {9155#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9156#(<= main_~i~0 18)} is VALID [2018-11-14 18:46:43,702 INFO L273 TraceCheckUtils]: 42: Hoare triple {9156#(<= main_~i~0 18)} assume true; {9156#(<= main_~i~0 18)} is VALID [2018-11-14 18:46:43,703 INFO L273 TraceCheckUtils]: 43: Hoare triple {9156#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9157#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:43,704 INFO L273 TraceCheckUtils]: 44: Hoare triple {9157#(<= main_~i~0 19)} assume true; {9157#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:43,705 INFO L273 TraceCheckUtils]: 45: Hoare triple {9157#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9158#(<= main_~i~0 20)} is VALID [2018-11-14 18:46:43,705 INFO L273 TraceCheckUtils]: 46: Hoare triple {9158#(<= main_~i~0 20)} assume true; {9158#(<= main_~i~0 20)} is VALID [2018-11-14 18:46:43,706 INFO L273 TraceCheckUtils]: 47: Hoare triple {9158#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9159#(<= main_~i~0 21)} is VALID [2018-11-14 18:46:43,707 INFO L273 TraceCheckUtils]: 48: Hoare triple {9159#(<= main_~i~0 21)} assume true; {9159#(<= main_~i~0 21)} is VALID [2018-11-14 18:46:43,707 INFO L273 TraceCheckUtils]: 49: Hoare triple {9159#(<= main_~i~0 21)} assume !(~i~0 < 100000); {9137#false} is VALID [2018-11-14 18:46:43,708 INFO L273 TraceCheckUtils]: 50: Hoare triple {9137#false} ~i~0 := 1; {9137#false} is VALID [2018-11-14 18:46:43,708 INFO L273 TraceCheckUtils]: 51: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:46:43,708 INFO L273 TraceCheckUtils]: 52: Hoare triple {9137#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9137#false} is VALID [2018-11-14 18:46:43,708 INFO L273 TraceCheckUtils]: 53: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:46:43,709 INFO L273 TraceCheckUtils]: 54: Hoare triple {9137#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9137#false} is VALID [2018-11-14 18:46:43,709 INFO L273 TraceCheckUtils]: 55: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:46:43,709 INFO L273 TraceCheckUtils]: 56: Hoare triple {9137#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9137#false} is VALID [2018-11-14 18:46:43,709 INFO L273 TraceCheckUtils]: 57: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:46:43,709 INFO L273 TraceCheckUtils]: 58: Hoare triple {9137#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9137#false} is VALID [2018-11-14 18:46:43,710 INFO L273 TraceCheckUtils]: 59: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:46:43,710 INFO L273 TraceCheckUtils]: 60: Hoare triple {9137#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9137#false} is VALID [2018-11-14 18:46:43,710 INFO L273 TraceCheckUtils]: 61: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:46:43,710 INFO L273 TraceCheckUtils]: 62: Hoare triple {9137#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9137#false} is VALID [2018-11-14 18:46:43,710 INFO L273 TraceCheckUtils]: 63: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:46:43,711 INFO L273 TraceCheckUtils]: 64: Hoare triple {9137#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9137#false} is VALID [2018-11-14 18:46:43,711 INFO L273 TraceCheckUtils]: 65: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:46:43,711 INFO L273 TraceCheckUtils]: 66: Hoare triple {9137#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9137#false} is VALID [2018-11-14 18:46:43,711 INFO L273 TraceCheckUtils]: 67: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:46:43,711 INFO L273 TraceCheckUtils]: 68: Hoare triple {9137#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9137#false} is VALID [2018-11-14 18:46:43,712 INFO L273 TraceCheckUtils]: 69: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:46:43,712 INFO L273 TraceCheckUtils]: 70: Hoare triple {9137#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9137#false} is VALID [2018-11-14 18:46:43,712 INFO L273 TraceCheckUtils]: 71: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:46:43,712 INFO L273 TraceCheckUtils]: 72: Hoare triple {9137#false} assume !(~i~0 < 100000); {9137#false} is VALID [2018-11-14 18:46:43,712 INFO L273 TraceCheckUtils]: 73: Hoare triple {9137#false} ~i~0 := 1;~j~0 := 0; {9137#false} is VALID [2018-11-14 18:46:43,712 INFO L273 TraceCheckUtils]: 74: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:46:43,713 INFO L273 TraceCheckUtils]: 75: Hoare triple {9137#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {9137#false} is VALID [2018-11-14 18:46:43,713 INFO L256 TraceCheckUtils]: 76: Hoare triple {9137#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9137#false} is VALID [2018-11-14 18:46:43,713 INFO L273 TraceCheckUtils]: 77: Hoare triple {9137#false} ~cond := #in~cond; {9137#false} is VALID [2018-11-14 18:46:43,713 INFO L273 TraceCheckUtils]: 78: Hoare triple {9137#false} assume ~cond == 0; {9137#false} is VALID [2018-11-14 18:46:43,713 INFO L273 TraceCheckUtils]: 79: Hoare triple {9137#false} assume !false; {9137#false} is VALID [2018-11-14 18:46:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-14 18:46:43,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:43,717 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-14 18:46:43,727 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:47:07,777 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-14 18:47:07,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:47:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:07,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:47:07,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {9136#true} call ULTIMATE.init(); {9136#true} is VALID [2018-11-14 18:47:07,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {9136#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9136#true} is VALID [2018-11-14 18:47:07,987 INFO L273 TraceCheckUtils]: 2: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9136#true} {9136#true} #63#return; {9136#true} is VALID [2018-11-14 18:47:07,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {9136#true} call #t~ret4 := main(); {9136#true} is VALID [2018-11-14 18:47:07,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {9136#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; {9136#true} is VALID [2018-11-14 18:47:07,987 INFO L273 TraceCheckUtils]: 6: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,991 INFO L273 TraceCheckUtils]: 11: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,992 INFO L273 TraceCheckUtils]: 17: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,992 INFO L273 TraceCheckUtils]: 18: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,993 INFO L273 TraceCheckUtils]: 19: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,993 INFO L273 TraceCheckUtils]: 20: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,993 INFO L273 TraceCheckUtils]: 21: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,993 INFO L273 TraceCheckUtils]: 22: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,993 INFO L273 TraceCheckUtils]: 23: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,993 INFO L273 TraceCheckUtils]: 24: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,994 INFO L273 TraceCheckUtils]: 25: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,994 INFO L273 TraceCheckUtils]: 26: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,994 INFO L273 TraceCheckUtils]: 27: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,994 INFO L273 TraceCheckUtils]: 28: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,994 INFO L273 TraceCheckUtils]: 29: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,994 INFO L273 TraceCheckUtils]: 30: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,995 INFO L273 TraceCheckUtils]: 33: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,995 INFO L273 TraceCheckUtils]: 36: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,995 INFO L273 TraceCheckUtils]: 37: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,996 INFO L273 TraceCheckUtils]: 38: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,996 INFO L273 TraceCheckUtils]: 39: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,996 INFO L273 TraceCheckUtils]: 40: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,996 INFO L273 TraceCheckUtils]: 41: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,996 INFO L273 TraceCheckUtils]: 42: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,996 INFO L273 TraceCheckUtils]: 43: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,997 INFO L273 TraceCheckUtils]: 44: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,997 INFO L273 TraceCheckUtils]: 45: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,997 INFO L273 TraceCheckUtils]: 46: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,997 INFO L273 TraceCheckUtils]: 47: Hoare triple {9136#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9136#true} is VALID [2018-11-14 18:47:07,997 INFO L273 TraceCheckUtils]: 48: Hoare triple {9136#true} assume true; {9136#true} is VALID [2018-11-14 18:47:07,997 INFO L273 TraceCheckUtils]: 49: Hoare triple {9136#true} assume !(~i~0 < 100000); {9136#true} is VALID [2018-11-14 18:47:08,000 INFO L273 TraceCheckUtils]: 50: Hoare triple {9136#true} ~i~0 := 1; {9139#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:08,001 INFO L273 TraceCheckUtils]: 51: Hoare triple {9139#(<= main_~i~0 1)} assume true; {9139#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:08,001 INFO L273 TraceCheckUtils]: 52: Hoare triple {9139#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9141#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:08,003 INFO L273 TraceCheckUtils]: 53: Hoare triple {9141#(<= main_~i~0 3)} assume true; {9141#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:08,003 INFO L273 TraceCheckUtils]: 54: Hoare triple {9141#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9143#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:08,004 INFO L273 TraceCheckUtils]: 55: Hoare triple {9143#(<= main_~i~0 5)} assume true; {9143#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:08,004 INFO L273 TraceCheckUtils]: 56: Hoare triple {9143#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9145#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:08,005 INFO L273 TraceCheckUtils]: 57: Hoare triple {9145#(<= main_~i~0 7)} assume true; {9145#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:08,006 INFO L273 TraceCheckUtils]: 58: Hoare triple {9145#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9147#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:08,006 INFO L273 TraceCheckUtils]: 59: Hoare triple {9147#(<= main_~i~0 9)} assume true; {9147#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:08,007 INFO L273 TraceCheckUtils]: 60: Hoare triple {9147#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9149#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:08,008 INFO L273 TraceCheckUtils]: 61: Hoare triple {9149#(<= main_~i~0 11)} assume true; {9149#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:08,009 INFO L273 TraceCheckUtils]: 62: Hoare triple {9149#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9151#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:08,009 INFO L273 TraceCheckUtils]: 63: Hoare triple {9151#(<= main_~i~0 13)} assume true; {9151#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:08,010 INFO L273 TraceCheckUtils]: 64: Hoare triple {9151#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9153#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:08,011 INFO L273 TraceCheckUtils]: 65: Hoare triple {9153#(<= main_~i~0 15)} assume true; {9153#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:08,012 INFO L273 TraceCheckUtils]: 66: Hoare triple {9153#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9155#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:08,012 INFO L273 TraceCheckUtils]: 67: Hoare triple {9155#(<= main_~i~0 17)} assume true; {9155#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:08,013 INFO L273 TraceCheckUtils]: 68: Hoare triple {9155#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9157#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:08,014 INFO L273 TraceCheckUtils]: 69: Hoare triple {9157#(<= main_~i~0 19)} assume true; {9157#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:08,015 INFO L273 TraceCheckUtils]: 70: Hoare triple {9157#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {9159#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:08,015 INFO L273 TraceCheckUtils]: 71: Hoare triple {9159#(<= main_~i~0 21)} assume true; {9159#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:08,016 INFO L273 TraceCheckUtils]: 72: Hoare triple {9159#(<= main_~i~0 21)} assume !(~i~0 < 100000); {9137#false} is VALID [2018-11-14 18:47:08,016 INFO L273 TraceCheckUtils]: 73: Hoare triple {9137#false} ~i~0 := 1;~j~0 := 0; {9137#false} is VALID [2018-11-14 18:47:08,017 INFO L273 TraceCheckUtils]: 74: Hoare triple {9137#false} assume true; {9137#false} is VALID [2018-11-14 18:47:08,017 INFO L273 TraceCheckUtils]: 75: Hoare triple {9137#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {9137#false} is VALID [2018-11-14 18:47:08,017 INFO L256 TraceCheckUtils]: 76: Hoare triple {9137#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9137#false} is VALID [2018-11-14 18:47:08,017 INFO L273 TraceCheckUtils]: 77: Hoare triple {9137#false} ~cond := #in~cond; {9137#false} is VALID [2018-11-14 18:47:08,017 INFO L273 TraceCheckUtils]: 78: Hoare triple {9137#false} assume ~cond == 0; {9137#false} is VALID [2018-11-14 18:47:08,018 INFO L273 TraceCheckUtils]: 79: Hoare triple {9137#false} assume !false; {9137#false} is VALID [2018-11-14 18:47:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-14 18:47:08,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:47:08,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 24 [2018-11-14 18:47:08,049 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 80 [2018-11-14 18:47:08,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:47:08,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:47:08,136 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-14 18:47:08,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:47:08,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:47:08,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:47:08,137 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 24 states. [2018-11-14 18:47:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:09,233 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2018-11-14 18:47:09,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 18:47:09,233 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 80 [2018-11-14 18:47:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:47:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:47:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 162 transitions. [2018-11-14 18:47:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:47:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 162 transitions. [2018-11-14 18:47:09,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 162 transitions. [2018-11-14 18:47:09,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:09,407 INFO L225 Difference]: With dead ends: 166 [2018-11-14 18:47:09,407 INFO L226 Difference]: Without dead ends: 132 [2018-11-14 18:47:09,407 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:47:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-14 18:47:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 88. [2018-11-14 18:47:09,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:47:09,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 88 states. [2018-11-14 18:47:09,444 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 88 states. [2018-11-14 18:47:09,444 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 88 states. [2018-11-14 18:47:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:09,447 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-11-14 18:47:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2018-11-14 18:47:09,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:09,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:09,448 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 132 states. [2018-11-14 18:47:09,448 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 132 states. [2018-11-14 18:47:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:09,451 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-11-14 18:47:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2018-11-14 18:47:09,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:09,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:09,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:47:09,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:47:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-14 18:47:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-11-14 18:47:09,454 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 80 [2018-11-14 18:47:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:47:09,454 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-11-14 18:47:09,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:47:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-11-14 18:47:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-14 18:47:09,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:47:09,455 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:47:09,455 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:47:09,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:47:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash 147139983, now seen corresponding path program 18 times [2018-11-14 18:47:09,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:47:09,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:47:09,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:09,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:47:09,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:10,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {10037#true} call ULTIMATE.init(); {10037#true} is VALID [2018-11-14 18:47:10,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {10037#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10037#true} is VALID [2018-11-14 18:47:10,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:10,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10037#true} {10037#true} #63#return; {10037#true} is VALID [2018-11-14 18:47:10,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {10037#true} call #t~ret4 := main(); {10037#true} is VALID [2018-11-14 18:47:10,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {10037#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; {10039#(= main_~i~0 0)} is VALID [2018-11-14 18:47:10,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {10039#(= main_~i~0 0)} assume true; {10039#(= main_~i~0 0)} is VALID [2018-11-14 18:47:10,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {10039#(= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10040#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:10,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {10040#(<= main_~i~0 1)} assume true; {10040#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:10,812 INFO L273 TraceCheckUtils]: 9: Hoare triple {10040#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10041#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:10,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {10041#(<= main_~i~0 2)} assume true; {10041#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:10,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {10041#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10042#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:10,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {10042#(<= main_~i~0 3)} assume true; {10042#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:10,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {10042#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10043#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:10,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {10043#(<= main_~i~0 4)} assume true; {10043#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:10,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {10043#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10044#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:10,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {10044#(<= main_~i~0 5)} assume true; {10044#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:10,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {10044#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10045#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:10,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {10045#(<= main_~i~0 6)} assume true; {10045#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:10,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {10045#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10046#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:10,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {10046#(<= main_~i~0 7)} assume true; {10046#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:10,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {10046#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10047#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:10,821 INFO L273 TraceCheckUtils]: 22: Hoare triple {10047#(<= main_~i~0 8)} assume true; {10047#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:10,822 INFO L273 TraceCheckUtils]: 23: Hoare triple {10047#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10048#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:10,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {10048#(<= main_~i~0 9)} assume true; {10048#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:10,823 INFO L273 TraceCheckUtils]: 25: Hoare triple {10048#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10049#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:10,824 INFO L273 TraceCheckUtils]: 26: Hoare triple {10049#(<= main_~i~0 10)} assume true; {10049#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:10,825 INFO L273 TraceCheckUtils]: 27: Hoare triple {10049#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10050#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:10,825 INFO L273 TraceCheckUtils]: 28: Hoare triple {10050#(<= main_~i~0 11)} assume true; {10050#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:10,826 INFO L273 TraceCheckUtils]: 29: Hoare triple {10050#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10051#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:10,826 INFO L273 TraceCheckUtils]: 30: Hoare triple {10051#(<= main_~i~0 12)} assume true; {10051#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:10,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {10051#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10052#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:10,828 INFO L273 TraceCheckUtils]: 32: Hoare triple {10052#(<= main_~i~0 13)} assume true; {10052#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:10,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {10052#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10053#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:10,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {10053#(<= main_~i~0 14)} assume true; {10053#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:10,830 INFO L273 TraceCheckUtils]: 35: Hoare triple {10053#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10054#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:10,831 INFO L273 TraceCheckUtils]: 36: Hoare triple {10054#(<= main_~i~0 15)} assume true; {10054#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:10,832 INFO L273 TraceCheckUtils]: 37: Hoare triple {10054#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10055#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:10,832 INFO L273 TraceCheckUtils]: 38: Hoare triple {10055#(<= main_~i~0 16)} assume true; {10055#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:10,833 INFO L273 TraceCheckUtils]: 39: Hoare triple {10055#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10056#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:10,834 INFO L273 TraceCheckUtils]: 40: Hoare triple {10056#(<= main_~i~0 17)} assume true; {10056#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:10,834 INFO L273 TraceCheckUtils]: 41: Hoare triple {10056#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10057#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:10,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {10057#(<= main_~i~0 18)} assume true; {10057#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:10,836 INFO L273 TraceCheckUtils]: 43: Hoare triple {10057#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10058#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:10,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {10058#(<= main_~i~0 19)} assume true; {10058#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:10,837 INFO L273 TraceCheckUtils]: 45: Hoare triple {10058#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10059#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:10,838 INFO L273 TraceCheckUtils]: 46: Hoare triple {10059#(<= main_~i~0 20)} assume true; {10059#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:10,839 INFO L273 TraceCheckUtils]: 47: Hoare triple {10059#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10060#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:10,839 INFO L273 TraceCheckUtils]: 48: Hoare triple {10060#(<= main_~i~0 21)} assume true; {10060#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:10,840 INFO L273 TraceCheckUtils]: 49: Hoare triple {10060#(<= 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 + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10061#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:10,841 INFO L273 TraceCheckUtils]: 50: Hoare triple {10061#(<= main_~i~0 22)} assume true; {10061#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:10,841 INFO L273 TraceCheckUtils]: 51: Hoare triple {10061#(<= main_~i~0 22)} assume !(~i~0 < 100000); {10038#false} is VALID [2018-11-14 18:47:10,841 INFO L273 TraceCheckUtils]: 52: Hoare triple {10038#false} ~i~0 := 1; {10038#false} is VALID [2018-11-14 18:47:10,842 INFO L273 TraceCheckUtils]: 53: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,842 INFO L273 TraceCheckUtils]: 54: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10038#false} is VALID [2018-11-14 18:47:10,842 INFO L273 TraceCheckUtils]: 55: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,842 INFO L273 TraceCheckUtils]: 56: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10038#false} is VALID [2018-11-14 18:47:10,842 INFO L273 TraceCheckUtils]: 57: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,843 INFO L273 TraceCheckUtils]: 58: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10038#false} is VALID [2018-11-14 18:47:10,843 INFO L273 TraceCheckUtils]: 59: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,843 INFO L273 TraceCheckUtils]: 60: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10038#false} is VALID [2018-11-14 18:47:10,843 INFO L273 TraceCheckUtils]: 61: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,843 INFO L273 TraceCheckUtils]: 62: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10038#false} is VALID [2018-11-14 18:47:10,844 INFO L273 TraceCheckUtils]: 63: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,844 INFO L273 TraceCheckUtils]: 64: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10038#false} is VALID [2018-11-14 18:47:10,844 INFO L273 TraceCheckUtils]: 65: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,844 INFO L273 TraceCheckUtils]: 66: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10038#false} is VALID [2018-11-14 18:47:10,844 INFO L273 TraceCheckUtils]: 67: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,844 INFO L273 TraceCheckUtils]: 68: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10038#false} is VALID [2018-11-14 18:47:10,845 INFO L273 TraceCheckUtils]: 69: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,845 INFO L273 TraceCheckUtils]: 70: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10038#false} is VALID [2018-11-14 18:47:10,845 INFO L273 TraceCheckUtils]: 71: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,845 INFO L273 TraceCheckUtils]: 72: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10038#false} is VALID [2018-11-14 18:47:10,845 INFO L273 TraceCheckUtils]: 73: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,845 INFO L273 TraceCheckUtils]: 74: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10038#false} is VALID [2018-11-14 18:47:10,845 INFO L273 TraceCheckUtils]: 75: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,845 INFO L273 TraceCheckUtils]: 76: Hoare triple {10038#false} assume !(~i~0 < 100000); {10038#false} is VALID [2018-11-14 18:47:10,846 INFO L273 TraceCheckUtils]: 77: Hoare triple {10038#false} ~i~0 := 1;~j~0 := 0; {10038#false} is VALID [2018-11-14 18:47:10,846 INFO L273 TraceCheckUtils]: 78: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:10,846 INFO L273 TraceCheckUtils]: 79: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {10038#false} is VALID [2018-11-14 18:47:10,846 INFO L256 TraceCheckUtils]: 80: Hoare triple {10038#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10038#false} is VALID [2018-11-14 18:47:10,846 INFO L273 TraceCheckUtils]: 81: Hoare triple {10038#false} ~cond := #in~cond; {10038#false} is VALID [2018-11-14 18:47:10,846 INFO L273 TraceCheckUtils]: 82: Hoare triple {10038#false} assume ~cond == 0; {10038#false} is VALID [2018-11-14 18:47:10,846 INFO L273 TraceCheckUtils]: 83: Hoare triple {10038#false} assume !false; {10038#false} is VALID [2018-11-14 18:47:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-14 18:47:10,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:47:10,850 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-14 18:47:10,859 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:47:37,634 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-14 18:47:37,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:47:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:37,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:47:37,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {10037#true} call ULTIMATE.init(); {10037#true} is VALID [2018-11-14 18:47:37,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {10037#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10037#true} is VALID [2018-11-14 18:47:37,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10037#true} {10037#true} #63#return; {10037#true} is VALID [2018-11-14 18:47:37,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {10037#true} call #t~ret4 := main(); {10037#true} is VALID [2018-11-14 18:47:37,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {10037#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; {10037#true} is VALID [2018-11-14 18:47:37,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,819 INFO L273 TraceCheckUtils]: 13: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,819 INFO L273 TraceCheckUtils]: 14: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,819 INFO L273 TraceCheckUtils]: 15: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,820 INFO L273 TraceCheckUtils]: 16: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,820 INFO L273 TraceCheckUtils]: 17: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,821 INFO L273 TraceCheckUtils]: 24: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,821 INFO L273 TraceCheckUtils]: 27: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,821 INFO L273 TraceCheckUtils]: 28: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,821 INFO L273 TraceCheckUtils]: 29: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,821 INFO L273 TraceCheckUtils]: 30: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,822 INFO L273 TraceCheckUtils]: 32: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,822 INFO L273 TraceCheckUtils]: 33: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,822 INFO L273 TraceCheckUtils]: 34: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,822 INFO L273 TraceCheckUtils]: 35: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,822 INFO L273 TraceCheckUtils]: 36: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,823 INFO L273 TraceCheckUtils]: 38: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,823 INFO L273 TraceCheckUtils]: 39: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,823 INFO L273 TraceCheckUtils]: 40: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,823 INFO L273 TraceCheckUtils]: 41: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,823 INFO L273 TraceCheckUtils]: 42: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,823 INFO L273 TraceCheckUtils]: 43: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,824 INFO L273 TraceCheckUtils]: 44: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,824 INFO L273 TraceCheckUtils]: 45: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,824 INFO L273 TraceCheckUtils]: 46: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,824 INFO L273 TraceCheckUtils]: 47: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,824 INFO L273 TraceCheckUtils]: 48: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,825 INFO L273 TraceCheckUtils]: 49: Hoare triple {10037#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10037#true} is VALID [2018-11-14 18:47:37,825 INFO L273 TraceCheckUtils]: 50: Hoare triple {10037#true} assume true; {10037#true} is VALID [2018-11-14 18:47:37,825 INFO L273 TraceCheckUtils]: 51: Hoare triple {10037#true} assume !(~i~0 < 100000); {10037#true} is VALID [2018-11-14 18:47:37,840 INFO L273 TraceCheckUtils]: 52: Hoare triple {10037#true} ~i~0 := 1; {10040#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:37,844 INFO L273 TraceCheckUtils]: 53: Hoare triple {10040#(<= main_~i~0 1)} assume true; {10040#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:37,845 INFO L273 TraceCheckUtils]: 54: Hoare triple {10040#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10042#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:37,845 INFO L273 TraceCheckUtils]: 55: Hoare triple {10042#(<= main_~i~0 3)} assume true; {10042#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:37,846 INFO L273 TraceCheckUtils]: 56: Hoare triple {10042#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10044#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:37,846 INFO L273 TraceCheckUtils]: 57: Hoare triple {10044#(<= main_~i~0 5)} assume true; {10044#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:37,847 INFO L273 TraceCheckUtils]: 58: Hoare triple {10044#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10046#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:37,847 INFO L273 TraceCheckUtils]: 59: Hoare triple {10046#(<= main_~i~0 7)} assume true; {10046#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:37,848 INFO L273 TraceCheckUtils]: 60: Hoare triple {10046#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10048#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:37,849 INFO L273 TraceCheckUtils]: 61: Hoare triple {10048#(<= main_~i~0 9)} assume true; {10048#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:37,850 INFO L273 TraceCheckUtils]: 62: Hoare triple {10048#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10050#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:37,850 INFO L273 TraceCheckUtils]: 63: Hoare triple {10050#(<= main_~i~0 11)} assume true; {10050#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:37,851 INFO L273 TraceCheckUtils]: 64: Hoare triple {10050#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10052#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:37,852 INFO L273 TraceCheckUtils]: 65: Hoare triple {10052#(<= main_~i~0 13)} assume true; {10052#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:37,853 INFO L273 TraceCheckUtils]: 66: Hoare triple {10052#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10054#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:37,853 INFO L273 TraceCheckUtils]: 67: Hoare triple {10054#(<= main_~i~0 15)} assume true; {10054#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:37,854 INFO L273 TraceCheckUtils]: 68: Hoare triple {10054#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10056#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:37,855 INFO L273 TraceCheckUtils]: 69: Hoare triple {10056#(<= main_~i~0 17)} assume true; {10056#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:37,856 INFO L273 TraceCheckUtils]: 70: Hoare triple {10056#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10058#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:37,856 INFO L273 TraceCheckUtils]: 71: Hoare triple {10058#(<= main_~i~0 19)} assume true; {10058#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:37,857 INFO L273 TraceCheckUtils]: 72: Hoare triple {10058#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10060#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:37,858 INFO L273 TraceCheckUtils]: 73: Hoare triple {10060#(<= main_~i~0 21)} assume true; {10060#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:37,859 INFO L273 TraceCheckUtils]: 74: Hoare triple {10060#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 2;~j~0 := ~j~0 + 1; {10287#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:37,859 INFO L273 TraceCheckUtils]: 75: Hoare triple {10287#(<= main_~i~0 23)} assume true; {10287#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:37,860 INFO L273 TraceCheckUtils]: 76: Hoare triple {10287#(<= main_~i~0 23)} assume !(~i~0 < 100000); {10038#false} is VALID [2018-11-14 18:47:37,860 INFO L273 TraceCheckUtils]: 77: Hoare triple {10038#false} ~i~0 := 1;~j~0 := 0; {10038#false} is VALID [2018-11-14 18:47:37,860 INFO L273 TraceCheckUtils]: 78: Hoare triple {10038#false} assume true; {10038#false} is VALID [2018-11-14 18:47:37,861 INFO L273 TraceCheckUtils]: 79: Hoare triple {10038#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (2 * ~j~0 + 1) * 4, 4); {10038#false} is VALID [2018-11-14 18:47:37,861 INFO L256 TraceCheckUtils]: 80: Hoare triple {10038#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10038#false} is VALID [2018-11-14 18:47:37,861 INFO L273 TraceCheckUtils]: 81: Hoare triple {10038#false} ~cond := #in~cond; {10038#false} is VALID [2018-11-14 18:47:37,861 INFO L273 TraceCheckUtils]: 82: Hoare triple {10038#false} assume ~cond == 0; {10038#false} is VALID [2018-11-14 18:47:37,862 INFO L273 TraceCheckUtils]: 83: Hoare triple {10038#false} assume !false; {10038#false} is VALID [2018-11-14 18:47:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-14 18:47:37,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:47:37,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 26 [2018-11-14 18:47:37,892 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-11-14 18:47:37,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:47:37,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 18:47:37,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:37,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 18:47:37,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 18:47:37,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:47:37,983 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 26 states. [2018-11-14 18:47:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:39,025 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2018-11-14 18:47:39,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 18:47:39,025 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-11-14 18:47:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:47:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:47:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 174 transitions. [2018-11-14 18:47:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:47:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 174 transitions. [2018-11-14 18:47:39,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 174 transitions. [2018-11-14 18:47:39,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:39,781 INFO L225 Difference]: With dead ends: 178 [2018-11-14 18:47:39,782 INFO L226 Difference]: Without dead ends: 142 [2018-11-14 18:47:39,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:47:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-14 18:47:40,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 94. [2018-11-14 18:47:40,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:47:40,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 94 states. [2018-11-14 18:47:40,828 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 94 states. [2018-11-14 18:47:40,829 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 94 states. [2018-11-14 18:47:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:40,832 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2018-11-14 18:47:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-11-14 18:47:40,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:40,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:40,833 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 142 states. [2018-11-14 18:47:40,833 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 142 states. [2018-11-14 18:47:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:40,837 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2018-11-14 18:47:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-11-14 18:47:40,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:40,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:40,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:47:40,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:47:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 18:47:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-11-14 18:47:40,840 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 84 [2018-11-14 18:47:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:47:40,841 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-11-14 18:47:40,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 18:47:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-11-14 18:47:40,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-14 18:47:40,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:47:40,842 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:47:40,842 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:47:40,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:47:40,843 INFO L82 PathProgramCache]: Analyzing trace with hash -365438731, now seen corresponding path program 19 times [2018-11-14 18:47:40,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:47:40,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:47:40,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:40,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:47:40,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat