java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_compare_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:39,260 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:39,262 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:39,281 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:39,281 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:39,283 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:39,285 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:39,287 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:39,289 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:39,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:39,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:39,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:39,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:39,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:39,300 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:39,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:39,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:39,303 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:39,305 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:39,310 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:39,311 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:39,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:39,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:39,315 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:39,315 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:39,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:39,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:39,318 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:39,319 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:39,320 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:39,320 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:39,321 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:39,321 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:39,321 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:39,322 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:39,323 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:39,323 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:58:39,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:39,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:39,341 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:39,342 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:39,342 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:39,343 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:39,343 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:39,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:39,343 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:39,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:39,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:39,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:39,344 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:39,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:39,344 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:39,345 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:39,345 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:39,345 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:39,345 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:39,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:39,346 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:39,346 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:39,346 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:39,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:39,346 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:39,346 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:39,347 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:39,347 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:39,347 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:39,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:39,347 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:39,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:39,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:39,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:39,427 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:39,427 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:39,428 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_compare_true-unreach-call_ground.i [2018-11-23 11:58:39,496 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa728ab8f/7237493c7b3c47b0b2a67ee0663c8123/FLAG4d2295d18 [2018-11-23 11:58:39,998 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:39,999 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_compare_true-unreach-call_ground.i [2018-11-23 11:58:40,007 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa728ab8f/7237493c7b3c47b0b2a67ee0663c8123/FLAG4d2295d18 [2018-11-23 11:58:40,326 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa728ab8f/7237493c7b3c47b0b2a67ee0663c8123 [2018-11-23 11:58:40,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:58:40,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:58:40,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:40,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:58:40,344 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:58:40,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:40" (1/1) ... [2018-11-23 11:58:40,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5623b179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40, skipping insertion in model container [2018-11-23 11:58:40,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:40" (1/1) ... [2018-11-23 11:58:40,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:58:40,387 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:58:40,628 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:40,633 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:58:40,660 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:40,693 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:58:40,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40 WrapperNode [2018-11-23 11:58:40,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:40,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:40,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:58:40,696 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:58:40,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40" (1/1) ... [2018-11-23 11:58:40,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40" (1/1) ... [2018-11-23 11:58:40,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:40,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:58:40,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:58:40,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:58:40,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40" (1/1) ... [2018-11-23 11:58:40,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40" (1/1) ... [2018-11-23 11:58:40,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40" (1/1) ... [2018-11-23 11:58:40,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40" (1/1) ... [2018-11-23 11:58:40,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40" (1/1) ... [2018-11-23 11:58:40,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40" (1/1) ... [2018-11-23 11:58:40,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40" (1/1) ... [2018-11-23 11:58:40,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:58:40,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:58:40,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:58:40,785 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:58:40,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:58:40,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:58:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:58:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:58:40,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:58:40,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:58:40,957 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:58:40,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:58:40,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:58:40,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:58:40,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:58:41,510 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:58:41,510 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:58:41,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:41 BoogieIcfgContainer [2018-11-23 11:58:41,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:58:41,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:58:41,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:58:41,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:58:41,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:58:40" (1/3) ... [2018-11-23 11:58:41,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0df45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:41, skipping insertion in model container [2018-11-23 11:58:41,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:40" (2/3) ... [2018-11-23 11:58:41,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0df45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:41, skipping insertion in model container [2018-11-23 11:58:41,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:41" (3/3) ... [2018-11-23 11:58:41,521 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_compare_true-unreach-call_ground.i [2018-11-23 11:58:41,531 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:58:41,539 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:58:41,556 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:58:41,600 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:58:41,601 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:58:41,601 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:58:41,601 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:58:41,602 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:58:41,602 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:58:41,602 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:58:41,602 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:58:41,603 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:58:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 11:58:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:58:41,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:41,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:41,632 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:41,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:41,638 INFO L82 PathProgramCache]: Analyzing trace with hash -55798999, now seen corresponding path program 1 times [2018-11-23 11:58:41,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:41,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:41,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:41,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:41,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:41,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 11:58:41,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 11:58:41,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 11:58:41,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #60#return; {28#true} is VALID [2018-11-23 11:58:41,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret5 := main(); {28#true} is VALID [2018-11-23 11:58:41,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {28#true} is VALID [2018-11-23 11:58:41,804 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 11:58:41,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {29#false} is VALID [2018-11-23 11:58:41,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {29#false} is VALID [2018-11-23 11:58:41,805 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {29#false} is VALID [2018-11-23 11:58:41,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 11:58:41,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2018-11-23 11:58:41,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 11:58:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:41,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:41,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:58:41,817 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:58:41,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:41,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:58:41,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:41,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:58:41,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:58:41,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:58:41,914 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 11:58:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:42,108 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-23 11:58:42,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:58:42,108 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:58:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 11:58:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 11:58:42,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2018-11-23 11:58:42,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:42,445 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:58:42,445 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:58:42,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:58:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:58:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:58:42,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:42,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:58:42,497 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:58:42,497 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:58:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:42,501 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:58:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:58:42,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:42,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:42,502 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:58:42,502 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:58:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:42,506 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:58:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:58:42,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:42,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:42,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:42,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 11:58:42,511 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 11:58:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:42,511 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 11:58:42,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:58:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:58:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:58:42,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:42,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:42,513 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:42,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1228404898, now seen corresponding path program 1 times [2018-11-23 11:58:42,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:42,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:42,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:42,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:42,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:42,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2018-11-23 11:58:42,610 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {152#true} is VALID [2018-11-23 11:58:42,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2018-11-23 11:58:42,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #60#return; {152#true} is VALID [2018-11-23 11:58:42,611 INFO L256 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret5 := main(); {152#true} is VALID [2018-11-23 11:58:42,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {154#(= main_~i~0 0)} is VALID [2018-11-23 11:58:42,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {154#(= main_~i~0 0)} assume !(~i~0 < 100000); {153#false} is VALID [2018-11-23 11:58:42,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {153#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {153#false} is VALID [2018-11-23 11:58:42,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {153#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {153#false} is VALID [2018-11-23 11:58:42,613 INFO L256 TraceCheckUtils]: 9: Hoare triple {153#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {153#false} is VALID [2018-11-23 11:58:42,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2018-11-23 11:58:42,614 INFO L273 TraceCheckUtils]: 11: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2018-11-23 11:58:42,614 INFO L273 TraceCheckUtils]: 12: Hoare triple {153#false} assume !false; {153#false} is VALID [2018-11-23 11:58:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:42,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:42,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:42,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:58:42,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:42,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:42,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:42,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:42,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:42,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:42,668 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 11:58:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:42,883 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 11:58:42,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:42,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:58:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:58:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:58:42,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 11:58:42,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:42,994 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:58:42,994 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:58:42,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:58:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 11:58:43,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:43,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2018-11-23 11:58:43,013 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2018-11-23 11:58:43,013 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2018-11-23 11:58:43,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:43,015 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:58:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:58:43,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:43,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:43,017 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2018-11-23 11:58:43,017 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2018-11-23 11:58:43,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:43,019 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:58:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:58:43,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:43,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:43,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:43,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:58:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 11:58:43,023 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 11:58:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:43,023 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 11:58:43,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:43,024 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 11:58:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:58:43,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:43,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:43,025 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:43,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:43,025 INFO L82 PathProgramCache]: Analyzing trace with hash 949462814, now seen corresponding path program 1 times [2018-11-23 11:58:43,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:43,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:43,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:43,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:43,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:43,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 11:58:43,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-23 11:58:43,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 11:58:43,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #60#return; {279#true} is VALID [2018-11-23 11:58:43,123 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret5 := main(); {279#true} is VALID [2018-11-23 11:58:43,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {279#true} is VALID [2018-11-23 11:58:43,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {279#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {279#true} is VALID [2018-11-23 11:58:43,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {279#true} assume #t~mem0 != #t~mem1;havoc #t~mem1;havoc #t~mem0;~rv~0 := 0; {281#(= main_~rv~0 0)} is VALID [2018-11-23 11:58:43,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {281#(= main_~rv~0 0)} ~i~0 := 1 + ~i~0; {281#(= main_~rv~0 0)} is VALID [2018-11-23 11:58:43,154 INFO L273 TraceCheckUtils]: 9: Hoare triple {281#(= main_~rv~0 0)} assume !(~i~0 < 100000); {281#(= main_~rv~0 0)} is VALID [2018-11-23 11:58:43,161 INFO L273 TraceCheckUtils]: 10: Hoare triple {281#(= main_~rv~0 0)} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-23 11:58:43,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {280#false} is VALID [2018-11-23 11:58:43,161 INFO L256 TraceCheckUtils]: 12: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {280#false} is VALID [2018-11-23 11:58:43,162 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 11:58:43,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 11:58:43,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 11:58:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:43,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:43,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:43,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:58:43,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:43,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:43,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:43,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:43,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:43,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:43,344 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2018-11-23 11:58:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:43,688 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:58:43,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:43,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:58:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:58:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:58:43,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 11:58:43,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:43,757 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:58:43,757 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:58:43,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:58:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:58:43,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:43,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:58:43,777 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:58:43,777 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:58:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:43,779 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 11:58:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 11:58:43,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:43,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:43,780 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:58:43,781 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:58:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:43,783 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 11:58:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 11:58:43,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:43,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:43,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:43,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:58:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 11:58:43,786 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2018-11-23 11:58:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:43,786 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 11:58:43,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 11:58:43,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:58:43,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:43,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:43,788 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:43,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:43,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1629521184, now seen corresponding path program 1 times [2018-11-23 11:58:43,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:43,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:43,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:43,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:43,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:43,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {404#true} call ULTIMATE.init(); {404#true} is VALID [2018-11-23 11:58:43,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {404#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {404#true} is VALID [2018-11-23 11:58:43,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {404#true} assume true; {404#true} is VALID [2018-11-23 11:58:43,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {404#true} {404#true} #60#return; {404#true} is VALID [2018-11-23 11:58:43,915 INFO L256 TraceCheckUtils]: 4: Hoare triple {404#true} call #t~ret5 := main(); {404#true} is VALID [2018-11-23 11:58:43,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {404#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {406#(= main_~i~0 0)} is VALID [2018-11-23 11:58:43,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {406#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {406#(= main_~i~0 0)} is VALID [2018-11-23 11:58:43,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {406#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {406#(= main_~i~0 0)} is VALID [2018-11-23 11:58:43,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {406#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {407#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:43,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {407#(<= main_~i~0 1)} assume !(~i~0 < 100000); {405#false} is VALID [2018-11-23 11:58:43,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {405#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {405#false} is VALID [2018-11-23 11:58:43,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {405#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {405#false} is VALID [2018-11-23 11:58:43,926 INFO L256 TraceCheckUtils]: 12: Hoare triple {405#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {405#false} is VALID [2018-11-23 11:58:43,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {405#false} ~cond := #in~cond; {405#false} is VALID [2018-11-23 11:58:43,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {405#false} assume 0 == ~cond; {405#false} is VALID [2018-11-23 11:58:43,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {405#false} assume !false; {405#false} is VALID [2018-11-23 11:58:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:43,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:43,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:43,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:43,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:44,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {404#true} call ULTIMATE.init(); {404#true} is VALID [2018-11-23 11:58:44,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {404#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {404#true} is VALID [2018-11-23 11:58:44,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {404#true} assume true; {404#true} is VALID [2018-11-23 11:58:44,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {404#true} {404#true} #60#return; {404#true} is VALID [2018-11-23 11:58:44,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {404#true} call #t~ret5 := main(); {404#true} is VALID [2018-11-23 11:58:44,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {404#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {426#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:44,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {426#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {426#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:44,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {426#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {426#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:44,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {426#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {407#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:44,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {407#(<= main_~i~0 1)} assume !(~i~0 < 100000); {405#false} is VALID [2018-11-23 11:58:44,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {405#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {405#false} is VALID [2018-11-23 11:58:44,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {405#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {405#false} is VALID [2018-11-23 11:58:44,272 INFO L256 TraceCheckUtils]: 12: Hoare triple {405#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {405#false} is VALID [2018-11-23 11:58:44,272 INFO L273 TraceCheckUtils]: 13: Hoare triple {405#false} ~cond := #in~cond; {405#false} is VALID [2018-11-23 11:58:44,273 INFO L273 TraceCheckUtils]: 14: Hoare triple {405#false} assume 0 == ~cond; {405#false} is VALID [2018-11-23 11:58:44,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {405#false} assume !false; {405#false} is VALID [2018-11-23 11:58:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:44,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:44,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:58:44,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 11:58:44,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:44,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:58:44,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:44,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:58:44,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:58:44,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:44,339 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-23 11:58:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:44,560 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 11:58:44,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:58:44,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 11:58:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2018-11-23 11:58:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2018-11-23 11:58:44,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2018-11-23 11:58:44,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:44,687 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:58:44,687 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:58:44,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:58:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 11:58:44,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:44,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 11:58:44,753 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 11:58:44,753 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 11:58:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:44,756 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:58:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:58:44,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:44,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:44,758 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 11:58:44,758 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 11:58:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:44,760 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:58:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:58:44,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:44,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:44,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:44,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:58:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 11:58:44,763 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2018-11-23 11:58:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:44,763 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 11:58:44,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:58:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 11:58:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:58:44,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:44,765 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:44,765 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:44,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:44,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1326245858, now seen corresponding path program 2 times [2018-11-23 11:58:44,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:44,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:44,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:44,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:44,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:44,904 INFO L256 TraceCheckUtils]: 0: Hoare triple {592#true} call ULTIMATE.init(); {592#true} is VALID [2018-11-23 11:58:44,904 INFO L273 TraceCheckUtils]: 1: Hoare triple {592#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {592#true} is VALID [2018-11-23 11:58:44,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {592#true} assume true; {592#true} is VALID [2018-11-23 11:58:44,905 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {592#true} {592#true} #60#return; {592#true} is VALID [2018-11-23 11:58:44,905 INFO L256 TraceCheckUtils]: 4: Hoare triple {592#true} call #t~ret5 := main(); {592#true} is VALID [2018-11-23 11:58:44,915 INFO L273 TraceCheckUtils]: 5: Hoare triple {592#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {594#(= main_~i~0 0)} is VALID [2018-11-23 11:58:44,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {594#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {594#(= main_~i~0 0)} is VALID [2018-11-23 11:58:44,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {594#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {594#(= main_~i~0 0)} is VALID [2018-11-23 11:58:44,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {594#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {595#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:44,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {595#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {595#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:44,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {595#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {595#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:44,930 INFO L273 TraceCheckUtils]: 11: Hoare triple {595#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {596#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:44,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {596#(<= main_~i~0 2)} assume !(~i~0 < 100000); {593#false} is VALID [2018-11-23 11:58:44,931 INFO L273 TraceCheckUtils]: 13: Hoare triple {593#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {593#false} is VALID [2018-11-23 11:58:44,931 INFO L273 TraceCheckUtils]: 14: Hoare triple {593#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {593#false} is VALID [2018-11-23 11:58:44,931 INFO L256 TraceCheckUtils]: 15: Hoare triple {593#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {593#false} is VALID [2018-11-23 11:58:44,932 INFO L273 TraceCheckUtils]: 16: Hoare triple {593#false} ~cond := #in~cond; {593#false} is VALID [2018-11-23 11:58:44,932 INFO L273 TraceCheckUtils]: 17: Hoare triple {593#false} assume 0 == ~cond; {593#false} is VALID [2018-11-23 11:58:44,932 INFO L273 TraceCheckUtils]: 18: Hoare triple {593#false} assume !false; {593#false} is VALID [2018-11-23 11:58:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:44,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:44,933 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:44,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:44,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:44,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:45,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:45,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {592#true} call ULTIMATE.init(); {592#true} is VALID [2018-11-23 11:58:45,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {592#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {592#true} is VALID [2018-11-23 11:58:45,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {592#true} assume true; {592#true} is VALID [2018-11-23 11:58:45,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {592#true} {592#true} #60#return; {592#true} is VALID [2018-11-23 11:58:45,081 INFO L256 TraceCheckUtils]: 4: Hoare triple {592#true} call #t~ret5 := main(); {592#true} is VALID [2018-11-23 11:58:45,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {592#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {615#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:45,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {615#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {615#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:45,083 INFO L273 TraceCheckUtils]: 7: Hoare triple {615#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {615#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:45,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {615#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {595#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,084 INFO L273 TraceCheckUtils]: 9: Hoare triple {595#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {595#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {595#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {595#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {595#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {596#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {596#(<= main_~i~0 2)} assume !(~i~0 < 100000); {593#false} is VALID [2018-11-23 11:58:45,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {593#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {593#false} is VALID [2018-11-23 11:58:45,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {593#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {593#false} is VALID [2018-11-23 11:58:45,093 INFO L256 TraceCheckUtils]: 15: Hoare triple {593#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {593#false} is VALID [2018-11-23 11:58:45,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {593#false} ~cond := #in~cond; {593#false} is VALID [2018-11-23 11:58:45,093 INFO L273 TraceCheckUtils]: 17: Hoare triple {593#false} assume 0 == ~cond; {593#false} is VALID [2018-11-23 11:58:45,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {593#false} assume !false; {593#false} is VALID [2018-11-23 11:58:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:45,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:45,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:58:45,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:58:45,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:45,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:58:45,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:45,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:58:45,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:58:45,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:58:45,151 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2018-11-23 11:58:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:45,329 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 11:58:45,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:58:45,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:58:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:58:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-23 11:58:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:58:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-23 11:58:45,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2018-11-23 11:58:45,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:45,425 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:58:45,425 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:58:45,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:58:45,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:58:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 11:58:45,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:45,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 11:58:45,439 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 11:58:45,440 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 11:58:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:45,443 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 11:58:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 11:58:45,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:45,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:45,444 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 11:58:45,444 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 11:58:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:45,446 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 11:58:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 11:58:45,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:45,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:45,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:45,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:58:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 11:58:45,449 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2018-11-23 11:58:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:45,449 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 11:58:45,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:58:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 11:58:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:58:45,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:45,451 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:45,451 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:45,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:45,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1162691488, now seen corresponding path program 3 times [2018-11-23 11:58:45,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:45,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:45,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:45,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:45,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:45,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2018-11-23 11:58:45,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {804#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {804#true} is VALID [2018-11-23 11:58:45,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2018-11-23 11:58:45,564 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #60#return; {804#true} is VALID [2018-11-23 11:58:45,564 INFO L256 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret5 := main(); {804#true} is VALID [2018-11-23 11:58:45,564 INFO L273 TraceCheckUtils]: 5: Hoare triple {804#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {806#(= main_~i~0 0)} is VALID [2018-11-23 11:58:45,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {806#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {806#(= main_~i~0 0)} is VALID [2018-11-23 11:58:45,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {806#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {806#(= main_~i~0 0)} is VALID [2018-11-23 11:58:45,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {806#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {807#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,586 INFO L273 TraceCheckUtils]: 9: Hoare triple {807#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {807#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {807#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {807#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:45,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {808#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {808#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {808#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {808#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {808#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {809#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {809#(<= main_~i~0 3)} assume !(~i~0 < 100000); {805#false} is VALID [2018-11-23 11:58:45,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {805#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {805#false} is VALID [2018-11-23 11:58:45,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {805#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {805#false} is VALID [2018-11-23 11:58:45,598 INFO L256 TraceCheckUtils]: 18: Hoare triple {805#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {805#false} is VALID [2018-11-23 11:58:45,598 INFO L273 TraceCheckUtils]: 19: Hoare triple {805#false} ~cond := #in~cond; {805#false} is VALID [2018-11-23 11:58:45,598 INFO L273 TraceCheckUtils]: 20: Hoare triple {805#false} assume 0 == ~cond; {805#false} is VALID [2018-11-23 11:58:45,599 INFO L273 TraceCheckUtils]: 21: Hoare triple {805#false} assume !false; {805#false} is VALID [2018-11-23 11:58:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:45,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:45,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:45,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:45,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:58:45,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:45,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:45,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:58:45,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:58:45,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:58:45,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-23 11:58:46,190 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:58:46,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 11:58:46,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 11:58:46,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:58:46,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:58:46,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:58:46,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:58:46,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:58:46,279 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 11:58:46,282 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:58:46,283 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#b~0.base|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#b~0.base|) 0)) (.cse1 (select (select |#memory_int| |main_~#a~0.base|) 0))) (and (= .cse0 |main_#t~mem4|) (= .cse1 .cse0) (= .cse1 |main_#t~mem3|) (not (= |main_~#b~0.base| |main_~#a~0.base|)))) [2018-11-23 11:58:46,283 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem4| |main_#t~mem3|) [2018-11-23 11:58:46,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2018-11-23 11:58:46,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {804#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {804#true} is VALID [2018-11-23 11:58:46,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2018-11-23 11:58:46,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #60#return; {804#true} is VALID [2018-11-23 11:58:46,333 INFO L256 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret5 := main(); {804#true} is VALID [2018-11-23 11:58:46,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {804#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {828#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:46,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {828#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {832#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) |main_#t~mem0|) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) |main_#t~mem1|) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:46,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {832#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) |main_#t~mem0|) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) |main_#t~mem1|) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:46,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:46,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:46,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:46,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:46,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:46,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:46,344 INFO L273 TraceCheckUtils]: 14: Hoare triple {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:46,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(~i~0 < 100000); {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:46,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {836#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {864#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:46,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {864#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {868#(= |main_#t~mem4| |main_#t~mem3|)} is VALID [2018-11-23 11:58:46,367 INFO L256 TraceCheckUtils]: 18: Hoare triple {868#(= |main_#t~mem4| |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {872#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:58:46,381 INFO L273 TraceCheckUtils]: 19: Hoare triple {872#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {876#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:58:46,390 INFO L273 TraceCheckUtils]: 20: Hoare triple {876#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {805#false} is VALID [2018-11-23 11:58:46,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {805#false} assume !false; {805#false} is VALID [2018-11-23 11:58:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:58:46,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:46,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-11-23 11:58:46,423 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-11-23 11:58:46,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:46,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:58:46,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:46,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:58:46,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:58:46,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:58:46,526 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2018-11-23 11:58:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:47,565 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-11-23 11:58:47,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:58:47,565 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-11-23 11:58:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:58:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2018-11-23 11:58:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:58:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2018-11-23 11:58:47,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2018-11-23 11:58:47,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:47,703 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:58:47,703 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:58:47,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:58:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:58:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-11-23 11:58:47,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:47,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 36 states. [2018-11-23 11:58:47,803 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 36 states. [2018-11-23 11:58:47,803 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 36 states. [2018-11-23 11:58:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:47,805 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 11:58:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 11:58:47,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:47,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:47,806 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 40 states. [2018-11-23 11:58:47,806 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 40 states. [2018-11-23 11:58:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:47,809 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 11:58:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 11:58:47,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:47,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:47,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:47,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:58:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 11:58:47,812 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 22 [2018-11-23 11:58:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:47,813 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 11:58:47,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:58:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 11:58:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:58:47,814 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:47,814 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:47,815 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:47,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:47,815 INFO L82 PathProgramCache]: Analyzing trace with hash -747792270, now seen corresponding path program 1 times [2018-11-23 11:58:47,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:47,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:47,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:47,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:47,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:47,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {1098#true} call ULTIMATE.init(); {1098#true} is VALID [2018-11-23 11:58:47,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {1098#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1098#true} is VALID [2018-11-23 11:58:47,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {1098#true} assume true; {1098#true} is VALID [2018-11-23 11:58:47,957 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1098#true} {1098#true} #60#return; {1098#true} is VALID [2018-11-23 11:58:47,957 INFO L256 TraceCheckUtils]: 4: Hoare triple {1098#true} call #t~ret5 := main(); {1098#true} is VALID [2018-11-23 11:58:47,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {1098#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {1100#(= main_~i~0 0)} is VALID [2018-11-23 11:58:47,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {1100#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1100#(= main_~i~0 0)} is VALID [2018-11-23 11:58:47,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {1100#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1100#(= main_~i~0 0)} is VALID [2018-11-23 11:58:47,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1101#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:47,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {1101#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1101#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:47,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {1101#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1101#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:47,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {1101#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1102#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:47,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {1102#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1102#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:47,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {1102#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1102#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:47,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {1102#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1103#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:47,964 INFO L273 TraceCheckUtils]: 15: Hoare triple {1103#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1103#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:47,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {1103#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1103#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:47,966 INFO L273 TraceCheckUtils]: 17: Hoare triple {1103#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1104#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:47,967 INFO L273 TraceCheckUtils]: 18: Hoare triple {1104#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1099#false} is VALID [2018-11-23 11:58:47,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {1099#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {1099#false} is VALID [2018-11-23 11:58:47,968 INFO L273 TraceCheckUtils]: 20: Hoare triple {1099#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1099#false} is VALID [2018-11-23 11:58:47,968 INFO L256 TraceCheckUtils]: 21: Hoare triple {1099#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1098#true} is VALID [2018-11-23 11:58:47,968 INFO L273 TraceCheckUtils]: 22: Hoare triple {1098#true} ~cond := #in~cond; {1098#true} is VALID [2018-11-23 11:58:47,969 INFO L273 TraceCheckUtils]: 23: Hoare triple {1098#true} assume !(0 == ~cond); {1098#true} is VALID [2018-11-23 11:58:47,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {1098#true} assume true; {1098#true} is VALID [2018-11-23 11:58:47,969 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1098#true} {1099#false} #64#return; {1099#false} is VALID [2018-11-23 11:58:47,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {1099#false} havoc #t~mem4;havoc #t~mem3; {1099#false} is VALID [2018-11-23 11:58:47,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {1099#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1099#false} is VALID [2018-11-23 11:58:47,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {1099#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1099#false} is VALID [2018-11-23 11:58:47,971 INFO L256 TraceCheckUtils]: 29: Hoare triple {1099#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1099#false} is VALID [2018-11-23 11:58:47,971 INFO L273 TraceCheckUtils]: 30: Hoare triple {1099#false} ~cond := #in~cond; {1099#false} is VALID [2018-11-23 11:58:47,971 INFO L273 TraceCheckUtils]: 31: Hoare triple {1099#false} assume 0 == ~cond; {1099#false} is VALID [2018-11-23 11:58:47,972 INFO L273 TraceCheckUtils]: 32: Hoare triple {1099#false} assume !false; {1099#false} is VALID [2018-11-23 11:58:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:58:47,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:47,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:47,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:48,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:48,308 INFO L256 TraceCheckUtils]: 0: Hoare triple {1098#true} call ULTIMATE.init(); {1098#true} is VALID [2018-11-23 11:58:48,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {1098#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1098#true} is VALID [2018-11-23 11:58:48,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {1098#true} assume true; {1098#true} is VALID [2018-11-23 11:58:48,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1098#true} {1098#true} #60#return; {1098#true} is VALID [2018-11-23 11:58:48,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {1098#true} call #t~ret5 := main(); {1098#true} is VALID [2018-11-23 11:58:48,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {1098#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {1123#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:48,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {1123#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1123#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:48,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {1123#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1123#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:48,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {1123#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1101#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:48,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {1101#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1101#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:48,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {1101#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1101#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:48,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {1101#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1102#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {1102#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1102#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {1102#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1102#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {1102#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1103#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {1103#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1103#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {1103#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1103#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {1103#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1104#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {1104#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1099#false} is VALID [2018-11-23 11:58:48,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {1099#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {1099#false} is VALID [2018-11-23 11:58:48,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {1099#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1099#false} is VALID [2018-11-23 11:58:48,329 INFO L256 TraceCheckUtils]: 21: Hoare triple {1099#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1099#false} is VALID [2018-11-23 11:58:48,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {1099#false} ~cond := #in~cond; {1099#false} is VALID [2018-11-23 11:58:48,330 INFO L273 TraceCheckUtils]: 23: Hoare triple {1099#false} assume !(0 == ~cond); {1099#false} is VALID [2018-11-23 11:58:48,330 INFO L273 TraceCheckUtils]: 24: Hoare triple {1099#false} assume true; {1099#false} is VALID [2018-11-23 11:58:48,330 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1099#false} {1099#false} #64#return; {1099#false} is VALID [2018-11-23 11:58:48,330 INFO L273 TraceCheckUtils]: 26: Hoare triple {1099#false} havoc #t~mem4;havoc #t~mem3; {1099#false} is VALID [2018-11-23 11:58:48,331 INFO L273 TraceCheckUtils]: 27: Hoare triple {1099#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1099#false} is VALID [2018-11-23 11:58:48,331 INFO L273 TraceCheckUtils]: 28: Hoare triple {1099#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1099#false} is VALID [2018-11-23 11:58:48,331 INFO L256 TraceCheckUtils]: 29: Hoare triple {1099#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1099#false} is VALID [2018-11-23 11:58:48,331 INFO L273 TraceCheckUtils]: 30: Hoare triple {1099#false} ~cond := #in~cond; {1099#false} is VALID [2018-11-23 11:58:48,331 INFO L273 TraceCheckUtils]: 31: Hoare triple {1099#false} assume 0 == ~cond; {1099#false} is VALID [2018-11-23 11:58:48,332 INFO L273 TraceCheckUtils]: 32: Hoare triple {1099#false} assume !false; {1099#false} is VALID [2018-11-23 11:58:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:58:48,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:48,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:58:48,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 11:58:48,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:48,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:58:48,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:48,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:58:48,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:58:48,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:48,412 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 8 states. [2018-11-23 11:58:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:48,556 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 11:58:48,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:58:48,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 11:58:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-11-23 11:58:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-11-23 11:58:48,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2018-11-23 11:58:48,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:48,628 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:58:48,628 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:58:48,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:58:48,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 11:58:48,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:48,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2018-11-23 11:58:48,750 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2018-11-23 11:58:48,750 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2018-11-23 11:58:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:48,752 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 11:58:48,753 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 11:58:48,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:48,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:48,754 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2018-11-23 11:58:48,754 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2018-11-23 11:58:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:48,756 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 11:58:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 11:58:48,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:48,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:48,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:48,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:58:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 11:58:48,759 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 33 [2018-11-23 11:58:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:48,760 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 11:58:48,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:58:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 11:58:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:58:48,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:48,761 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:48,762 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:48,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:48,762 INFO L82 PathProgramCache]: Analyzing trace with hash 495952180, now seen corresponding path program 2 times [2018-11-23 11:58:48,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:48,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:48,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:48,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:48,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:48,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {1421#true} call ULTIMATE.init(); {1421#true} is VALID [2018-11-23 11:58:48,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {1421#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1421#true} is VALID [2018-11-23 11:58:48,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2018-11-23 11:58:48,944 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1421#true} #60#return; {1421#true} is VALID [2018-11-23 11:58:48,944 INFO L256 TraceCheckUtils]: 4: Hoare triple {1421#true} call #t~ret5 := main(); {1421#true} is VALID [2018-11-23 11:58:48,945 INFO L273 TraceCheckUtils]: 5: Hoare triple {1421#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {1423#(= main_~i~0 0)} is VALID [2018-11-23 11:58:48,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {1423#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1423#(= main_~i~0 0)} is VALID [2018-11-23 11:58:48,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {1423#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1423#(= main_~i~0 0)} is VALID [2018-11-23 11:58:48,966 INFO L273 TraceCheckUtils]: 8: Hoare triple {1423#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1424#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:48,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {1424#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1424#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:48,989 INFO L273 TraceCheckUtils]: 10: Hoare triple {1424#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1424#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:48,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {1424#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1425#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:49,000 INFO L273 TraceCheckUtils]: 12: Hoare triple {1425#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1425#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:49,000 INFO L273 TraceCheckUtils]: 13: Hoare triple {1425#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1425#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:49,002 INFO L273 TraceCheckUtils]: 14: Hoare triple {1425#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1426#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:49,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {1426#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1426#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:49,003 INFO L273 TraceCheckUtils]: 16: Hoare triple {1426#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1426#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:49,003 INFO L273 TraceCheckUtils]: 17: Hoare triple {1426#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1427#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:49,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {1427#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1427#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:49,004 INFO L273 TraceCheckUtils]: 19: Hoare triple {1427#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1427#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:49,005 INFO L273 TraceCheckUtils]: 20: Hoare triple {1427#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1428#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:49,005 INFO L273 TraceCheckUtils]: 21: Hoare triple {1428#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1422#false} is VALID [2018-11-23 11:58:49,005 INFO L273 TraceCheckUtils]: 22: Hoare triple {1422#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {1422#false} is VALID [2018-11-23 11:58:49,006 INFO L273 TraceCheckUtils]: 23: Hoare triple {1422#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1422#false} is VALID [2018-11-23 11:58:49,006 INFO L256 TraceCheckUtils]: 24: Hoare triple {1422#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1421#true} is VALID [2018-11-23 11:58:49,006 INFO L273 TraceCheckUtils]: 25: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2018-11-23 11:58:49,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2018-11-23 11:58:49,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {1421#true} assume true; {1421#true} is VALID [2018-11-23 11:58:49,007 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1421#true} {1422#false} #64#return; {1422#false} is VALID [2018-11-23 11:58:49,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {1422#false} havoc #t~mem4;havoc #t~mem3; {1422#false} is VALID [2018-11-23 11:58:49,008 INFO L273 TraceCheckUtils]: 30: Hoare triple {1422#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1422#false} is VALID [2018-11-23 11:58:49,008 INFO L273 TraceCheckUtils]: 31: Hoare triple {1422#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1422#false} is VALID [2018-11-23 11:58:49,009 INFO L256 TraceCheckUtils]: 32: Hoare triple {1422#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1422#false} is VALID [2018-11-23 11:58:49,009 INFO L273 TraceCheckUtils]: 33: Hoare triple {1422#false} ~cond := #in~cond; {1422#false} is VALID [2018-11-23 11:58:49,009 INFO L273 TraceCheckUtils]: 34: Hoare triple {1422#false} assume 0 == ~cond; {1422#false} is VALID [2018-11-23 11:58:49,010 INFO L273 TraceCheckUtils]: 35: Hoare triple {1422#false} assume !false; {1422#false} is VALID [2018-11-23 11:58:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:58:49,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:49,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:49,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:49,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:49,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:49,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:49,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {1421#true} call ULTIMATE.init(); {1421#true} is VALID [2018-11-23 11:58:49,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {1421#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1421#true} is VALID [2018-11-23 11:58:49,194 INFO L273 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2018-11-23 11:58:49,195 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1421#true} #60#return; {1421#true} is VALID [2018-11-23 11:58:49,195 INFO L256 TraceCheckUtils]: 4: Hoare triple {1421#true} call #t~ret5 := main(); {1421#true} is VALID [2018-11-23 11:58:49,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {1421#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {1447#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:49,205 INFO L273 TraceCheckUtils]: 6: Hoare triple {1447#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1447#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:49,205 INFO L273 TraceCheckUtils]: 7: Hoare triple {1447#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1447#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:49,206 INFO L273 TraceCheckUtils]: 8: Hoare triple {1447#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1424#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:49,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {1424#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1424#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:49,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {1424#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1424#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:49,210 INFO L273 TraceCheckUtils]: 11: Hoare triple {1424#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1425#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:49,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {1425#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1425#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:49,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {1425#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1425#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:49,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {1425#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1426#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:49,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {1426#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1426#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:49,222 INFO L273 TraceCheckUtils]: 16: Hoare triple {1426#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1426#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:49,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {1426#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1427#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:49,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {1427#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1427#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:49,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {1427#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1427#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:49,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {1427#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1428#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:49,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {1428#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1422#false} is VALID [2018-11-23 11:58:49,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {1422#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {1422#false} is VALID [2018-11-23 11:58:49,225 INFO L273 TraceCheckUtils]: 23: Hoare triple {1422#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1422#false} is VALID [2018-11-23 11:58:49,226 INFO L256 TraceCheckUtils]: 24: Hoare triple {1422#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1422#false} is VALID [2018-11-23 11:58:49,226 INFO L273 TraceCheckUtils]: 25: Hoare triple {1422#false} ~cond := #in~cond; {1422#false} is VALID [2018-11-23 11:58:49,226 INFO L273 TraceCheckUtils]: 26: Hoare triple {1422#false} assume !(0 == ~cond); {1422#false} is VALID [2018-11-23 11:58:49,226 INFO L273 TraceCheckUtils]: 27: Hoare triple {1422#false} assume true; {1422#false} is VALID [2018-11-23 11:58:49,226 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1422#false} {1422#false} #64#return; {1422#false} is VALID [2018-11-23 11:58:49,227 INFO L273 TraceCheckUtils]: 29: Hoare triple {1422#false} havoc #t~mem4;havoc #t~mem3; {1422#false} is VALID [2018-11-23 11:58:49,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {1422#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1422#false} is VALID [2018-11-23 11:58:49,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {1422#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1422#false} is VALID [2018-11-23 11:58:49,228 INFO L256 TraceCheckUtils]: 32: Hoare triple {1422#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1422#false} is VALID [2018-11-23 11:58:49,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {1422#false} ~cond := #in~cond; {1422#false} is VALID [2018-11-23 11:58:49,228 INFO L273 TraceCheckUtils]: 34: Hoare triple {1422#false} assume 0 == ~cond; {1422#false} is VALID [2018-11-23 11:58:49,228 INFO L273 TraceCheckUtils]: 35: Hoare triple {1422#false} assume !false; {1422#false} is VALID [2018-11-23 11:58:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:58:49,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:49,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:58:49,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 11:58:49,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:49,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:58:49,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:49,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:58:49,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:58:49,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:58:49,300 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 9 states. [2018-11-23 11:58:49,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:49,507 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-23 11:58:49,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:58:49,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 11:58:49,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:58:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-23 11:58:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:58:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-23 11:58:49,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2018-11-23 11:58:49,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:49,733 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:58:49,733 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:58:49,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:58:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:58:49,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 11:58:49,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:49,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-23 11:58:49,954 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-23 11:58:49,954 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-23 11:58:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:49,956 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 11:58:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 11:58:49,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:49,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:49,957 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-23 11:58:49,957 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-23 11:58:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:49,960 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 11:58:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 11:58:49,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:49,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:49,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:49,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:58:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 11:58:49,963 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 36 [2018-11-23 11:58:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:49,963 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 11:58:49,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:58:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 11:58:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:58:49,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:49,964 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:49,965 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:49,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash 203999538, now seen corresponding path program 3 times [2018-11-23 11:58:49,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:49,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:49,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:49,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:49,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:50,211 INFO L256 TraceCheckUtils]: 0: Hoare triple {1768#true} call ULTIMATE.init(); {1768#true} is VALID [2018-11-23 11:58:50,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {1768#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1768#true} is VALID [2018-11-23 11:58:50,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {1768#true} assume true; {1768#true} is VALID [2018-11-23 11:58:50,212 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1768#true} {1768#true} #60#return; {1768#true} is VALID [2018-11-23 11:58:50,212 INFO L256 TraceCheckUtils]: 4: Hoare triple {1768#true} call #t~ret5 := main(); {1768#true} is VALID [2018-11-23 11:58:50,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {1768#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {1770#(= main_~i~0 0)} is VALID [2018-11-23 11:58:50,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {1770#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1770#(= main_~i~0 0)} is VALID [2018-11-23 11:58:50,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {1770#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1770#(= main_~i~0 0)} is VALID [2018-11-23 11:58:50,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {1770#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1771#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {1771#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1771#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,216 INFO L273 TraceCheckUtils]: 10: Hoare triple {1771#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1771#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:50,217 INFO L273 TraceCheckUtils]: 11: Hoare triple {1771#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1772#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,217 INFO L273 TraceCheckUtils]: 12: Hoare triple {1772#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1772#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {1772#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1772#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {1772#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1773#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {1773#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1773#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {1773#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1773#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {1773#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1774#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {1774#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1774#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {1774#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1774#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {1774#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1775#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {1775#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1775#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {1775#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1775#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {1775#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1776#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,227 INFO L273 TraceCheckUtils]: 24: Hoare triple {1776#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1769#false} is VALID [2018-11-23 11:58:50,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {1769#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {1769#false} is VALID [2018-11-23 11:58:50,228 INFO L273 TraceCheckUtils]: 26: Hoare triple {1769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1769#false} is VALID [2018-11-23 11:58:50,228 INFO L256 TraceCheckUtils]: 27: Hoare triple {1769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1768#true} is VALID [2018-11-23 11:58:50,228 INFO L273 TraceCheckUtils]: 28: Hoare triple {1768#true} ~cond := #in~cond; {1768#true} is VALID [2018-11-23 11:58:50,229 INFO L273 TraceCheckUtils]: 29: Hoare triple {1768#true} assume !(0 == ~cond); {1768#true} is VALID [2018-11-23 11:58:50,229 INFO L273 TraceCheckUtils]: 30: Hoare triple {1768#true} assume true; {1768#true} is VALID [2018-11-23 11:58:50,229 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1768#true} {1769#false} #64#return; {1769#false} is VALID [2018-11-23 11:58:50,230 INFO L273 TraceCheckUtils]: 32: Hoare triple {1769#false} havoc #t~mem4;havoc #t~mem3; {1769#false} is VALID [2018-11-23 11:58:50,230 INFO L273 TraceCheckUtils]: 33: Hoare triple {1769#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1769#false} is VALID [2018-11-23 11:58:50,230 INFO L273 TraceCheckUtils]: 34: Hoare triple {1769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1769#false} is VALID [2018-11-23 11:58:50,231 INFO L256 TraceCheckUtils]: 35: Hoare triple {1769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1769#false} is VALID [2018-11-23 11:58:50,231 INFO L273 TraceCheckUtils]: 36: Hoare triple {1769#false} ~cond := #in~cond; {1769#false} is VALID [2018-11-23 11:58:50,231 INFO L273 TraceCheckUtils]: 37: Hoare triple {1769#false} assume 0 == ~cond; {1769#false} is VALID [2018-11-23 11:58:50,231 INFO L273 TraceCheckUtils]: 38: Hoare triple {1769#false} assume !false; {1769#false} is VALID [2018-11-23 11:58:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:58:50,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:50,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:50,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:50,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:58:50,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:50,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:50,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:58:50,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:58:50,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:58:50,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-23 11:58:52,686 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)))) is different from true [2018-11-23 11:58:52,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 11:58:52,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 11:58:52,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:58:52,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:58:52,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:58:52,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:58:52,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:58:52,939 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 11:58:52,942 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:58:52,942 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#b~0.base|]. (let ((.cse1 (select (select |#memory_int| |main_~#b~0.base|) 4)) (.cse0 (select (select |#memory_int| |main_~#a~0.base|) 4))) (and (= .cse0 .cse1) (= |main_#t~mem4| .cse1) (= .cse0 |main_#t~mem3|) (not (= |main_~#b~0.base| |main_~#a~0.base|)))) [2018-11-23 11:58:52,942 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem4| |main_#t~mem3|) [2018-11-23 11:58:52,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {1768#true} call ULTIMATE.init(); {1768#true} is VALID [2018-11-23 11:58:52,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {1768#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1768#true} is VALID [2018-11-23 11:58:52,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {1768#true} assume true; {1768#true} is VALID [2018-11-23 11:58:52,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1768#true} {1768#true} #60#return; {1768#true} is VALID [2018-11-23 11:58:52,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {1768#true} call #t~ret5 := main(); {1768#true} is VALID [2018-11-23 11:58:52,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {1768#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {1795#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:52,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {1795#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1795#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:52,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {1795#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1795#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:52,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {1795#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {1805#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:52,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {1805#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1809#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) |main_#t~mem1|) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) |main_#t~mem0|) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:52,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {1809#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) |main_#t~mem1|) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) |main_#t~mem0|) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:52,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:52,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:52,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:52,999 INFO L273 TraceCheckUtils]: 14: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:52,999 INFO L273 TraceCheckUtils]: 15: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,000 INFO L273 TraceCheckUtils]: 16: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,000 INFO L273 TraceCheckUtils]: 17: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,003 INFO L273 TraceCheckUtils]: 20: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,004 INFO L273 TraceCheckUtils]: 21: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,004 INFO L273 TraceCheckUtils]: 22: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,015 INFO L273 TraceCheckUtils]: 23: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,015 INFO L273 TraceCheckUtils]: 24: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(~i~0 < 100000); {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,016 INFO L273 TraceCheckUtils]: 25: Hoare triple {1813#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {1859#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {1859#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1859#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,018 INFO L256 TraceCheckUtils]: 27: Hoare triple {1859#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1866#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:58:53,019 INFO L273 TraceCheckUtils]: 28: Hoare triple {1866#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} ~cond := #in~cond; {1866#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:58:53,019 INFO L273 TraceCheckUtils]: 29: Hoare triple {1866#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} assume !(0 == ~cond); {1866#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:58:53,019 INFO L273 TraceCheckUtils]: 30: Hoare triple {1866#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} assume true; {1866#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:58:53,020 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1866#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} {1859#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #64#return; {1859#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,021 INFO L273 TraceCheckUtils]: 32: Hoare triple {1859#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} havoc #t~mem4;havoc #t~mem3; {1859#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,022 INFO L273 TraceCheckUtils]: 33: Hoare triple {1859#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1885#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:58:53,023 INFO L273 TraceCheckUtils]: 34: Hoare triple {1885#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1889#(= |main_#t~mem4| |main_#t~mem3|)} is VALID [2018-11-23 11:58:53,024 INFO L256 TraceCheckUtils]: 35: Hoare triple {1889#(= |main_#t~mem4| |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1893#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:58:53,025 INFO L273 TraceCheckUtils]: 36: Hoare triple {1893#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1897#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:58:53,026 INFO L273 TraceCheckUtils]: 37: Hoare triple {1897#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1769#false} is VALID [2018-11-23 11:58:53,026 INFO L273 TraceCheckUtils]: 38: Hoare triple {1769#false} assume !false; {1769#false} is VALID [2018-11-23 11:58:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 26 trivial. 2 not checked. [2018-11-23 11:58:53,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:53,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-11-23 11:58:53,052 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-11-23 11:58:53,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:53,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:58:53,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:53,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:58:53,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:58:53,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=240, Unknown=1, NotChecked=32, Total=342 [2018-11-23 11:58:53,181 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 19 states. [2018-11-23 11:59:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:41,452 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-23 11:59:41,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:59:41,452 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-11-23 11:59:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:59:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 71 transitions. [2018-11-23 11:59:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:59:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 71 transitions. [2018-11-23 11:59:41,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 71 transitions. [2018-11-23 11:59:41,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:41,554 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:59:41,555 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 11:59:41,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=146, Invalid=613, Unknown=1, NotChecked=52, Total=812 [2018-11-23 11:59:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 11:59:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-23 11:59:41,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:41,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2018-11-23 11:59:41,680 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2018-11-23 11:59:41,680 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2018-11-23 11:59:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:41,683 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 11:59:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 11:59:41,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:41,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:41,683 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2018-11-23 11:59:41,683 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2018-11-23 11:59:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:41,686 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 11:59:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 11:59:41,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:41,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:41,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:41,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:59:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-23 11:59:41,688 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 39 [2018-11-23 11:59:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:41,689 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-23 11:59:41,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:59:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 11:59:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:59:41,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:41,690 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:41,690 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:41,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:41,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2077671944, now seen corresponding path program 4 times [2018-11-23 11:59:41,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:41,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:41,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:41,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:41,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:41,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {2212#true} call ULTIMATE.init(); {2212#true} is VALID [2018-11-23 11:59:41,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {2212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2212#true} is VALID [2018-11-23 11:59:41,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {2212#true} assume true; {2212#true} is VALID [2018-11-23 11:59:41,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2212#true} {2212#true} #60#return; {2212#true} is VALID [2018-11-23 11:59:41,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {2212#true} call #t~ret5 := main(); {2212#true} is VALID [2018-11-23 11:59:41,896 INFO L273 TraceCheckUtils]: 5: Hoare triple {2212#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {2214#(= main_~i~0 0)} is VALID [2018-11-23 11:59:41,896 INFO L273 TraceCheckUtils]: 6: Hoare triple {2214#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2214#(= main_~i~0 0)} is VALID [2018-11-23 11:59:41,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {2214#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2214#(= main_~i~0 0)} is VALID [2018-11-23 11:59:41,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {2214#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2215#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:41,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {2215#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2215#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:41,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {2215#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2215#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:41,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {2215#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2216#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:41,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {2216#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2216#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:41,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {2216#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2216#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:41,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {2216#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2217#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:41,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {2217#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2217#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:41,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {2217#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2217#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:41,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {2217#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2218#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:41,910 INFO L273 TraceCheckUtils]: 18: Hoare triple {2218#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2218#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:41,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {2218#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2218#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:41,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {2218#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2219#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:41,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {2219#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2219#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:41,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {2219#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2219#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:41,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {2219#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2220#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:41,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {2220#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2220#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:41,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {2220#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2220#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:41,914 INFO L273 TraceCheckUtils]: 26: Hoare triple {2220#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2221#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:41,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {2221#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2213#false} is VALID [2018-11-23 11:59:41,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {2213#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {2213#false} is VALID [2018-11-23 11:59:41,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {2213#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2213#false} is VALID [2018-11-23 11:59:41,916 INFO L256 TraceCheckUtils]: 30: Hoare triple {2213#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2212#true} is VALID [2018-11-23 11:59:41,916 INFO L273 TraceCheckUtils]: 31: Hoare triple {2212#true} ~cond := #in~cond; {2212#true} is VALID [2018-11-23 11:59:41,916 INFO L273 TraceCheckUtils]: 32: Hoare triple {2212#true} assume !(0 == ~cond); {2212#true} is VALID [2018-11-23 11:59:41,917 INFO L273 TraceCheckUtils]: 33: Hoare triple {2212#true} assume true; {2212#true} is VALID [2018-11-23 11:59:41,917 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2212#true} {2213#false} #64#return; {2213#false} is VALID [2018-11-23 11:59:41,917 INFO L273 TraceCheckUtils]: 35: Hoare triple {2213#false} havoc #t~mem4;havoc #t~mem3; {2213#false} is VALID [2018-11-23 11:59:41,917 INFO L273 TraceCheckUtils]: 36: Hoare triple {2213#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2213#false} is VALID [2018-11-23 11:59:41,918 INFO L273 TraceCheckUtils]: 37: Hoare triple {2213#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2213#false} is VALID [2018-11-23 11:59:41,918 INFO L256 TraceCheckUtils]: 38: Hoare triple {2213#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2212#true} is VALID [2018-11-23 11:59:41,918 INFO L273 TraceCheckUtils]: 39: Hoare triple {2212#true} ~cond := #in~cond; {2212#true} is VALID [2018-11-23 11:59:41,918 INFO L273 TraceCheckUtils]: 40: Hoare triple {2212#true} assume !(0 == ~cond); {2212#true} is VALID [2018-11-23 11:59:41,918 INFO L273 TraceCheckUtils]: 41: Hoare triple {2212#true} assume true; {2212#true} is VALID [2018-11-23 11:59:41,918 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2212#true} {2213#false} #64#return; {2213#false} is VALID [2018-11-23 11:59:41,919 INFO L273 TraceCheckUtils]: 43: Hoare triple {2213#false} havoc #t~mem4;havoc #t~mem3; {2213#false} is VALID [2018-11-23 11:59:41,919 INFO L273 TraceCheckUtils]: 44: Hoare triple {2213#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2213#false} is VALID [2018-11-23 11:59:41,919 INFO L273 TraceCheckUtils]: 45: Hoare triple {2213#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2213#false} is VALID [2018-11-23 11:59:41,919 INFO L256 TraceCheckUtils]: 46: Hoare triple {2213#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2213#false} is VALID [2018-11-23 11:59:41,919 INFO L273 TraceCheckUtils]: 47: Hoare triple {2213#false} ~cond := #in~cond; {2213#false} is VALID [2018-11-23 11:59:41,919 INFO L273 TraceCheckUtils]: 48: Hoare triple {2213#false} assume 0 == ~cond; {2213#false} is VALID [2018-11-23 11:59:41,919 INFO L273 TraceCheckUtils]: 49: Hoare triple {2213#false} assume !false; {2213#false} is VALID [2018-11-23 11:59:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:59:41,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:41,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:41,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:41,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:41,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:42,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:42,409 INFO L256 TraceCheckUtils]: 0: Hoare triple {2212#true} call ULTIMATE.init(); {2212#true} is VALID [2018-11-23 11:59:42,410 INFO L273 TraceCheckUtils]: 1: Hoare triple {2212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2212#true} is VALID [2018-11-23 11:59:42,410 INFO L273 TraceCheckUtils]: 2: Hoare triple {2212#true} assume true; {2212#true} is VALID [2018-11-23 11:59:42,410 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2212#true} {2212#true} #60#return; {2212#true} is VALID [2018-11-23 11:59:42,410 INFO L256 TraceCheckUtils]: 4: Hoare triple {2212#true} call #t~ret5 := main(); {2212#true} is VALID [2018-11-23 11:59:42,411 INFO L273 TraceCheckUtils]: 5: Hoare triple {2212#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {2240#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:42,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {2240#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2240#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:42,412 INFO L273 TraceCheckUtils]: 7: Hoare triple {2240#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2240#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:42,412 INFO L273 TraceCheckUtils]: 8: Hoare triple {2240#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2215#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:42,412 INFO L273 TraceCheckUtils]: 9: Hoare triple {2215#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2215#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:42,413 INFO L273 TraceCheckUtils]: 10: Hoare triple {2215#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2215#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:42,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {2215#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2216#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:42,414 INFO L273 TraceCheckUtils]: 12: Hoare triple {2216#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2216#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:42,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {2216#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2216#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:42,415 INFO L273 TraceCheckUtils]: 14: Hoare triple {2216#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2217#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:42,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {2217#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2217#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:42,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {2217#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2217#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:42,417 INFO L273 TraceCheckUtils]: 17: Hoare triple {2217#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2218#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:42,417 INFO L273 TraceCheckUtils]: 18: Hoare triple {2218#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2218#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:42,418 INFO L273 TraceCheckUtils]: 19: Hoare triple {2218#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2218#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:42,419 INFO L273 TraceCheckUtils]: 20: Hoare triple {2218#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2219#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:42,419 INFO L273 TraceCheckUtils]: 21: Hoare triple {2219#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2219#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:42,420 INFO L273 TraceCheckUtils]: 22: Hoare triple {2219#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2219#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:42,421 INFO L273 TraceCheckUtils]: 23: Hoare triple {2219#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2220#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:42,421 INFO L273 TraceCheckUtils]: 24: Hoare triple {2220#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2220#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:42,422 INFO L273 TraceCheckUtils]: 25: Hoare triple {2220#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2220#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:42,422 INFO L273 TraceCheckUtils]: 26: Hoare triple {2220#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2221#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:42,423 INFO L273 TraceCheckUtils]: 27: Hoare triple {2221#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2213#false} is VALID [2018-11-23 11:59:42,423 INFO L273 TraceCheckUtils]: 28: Hoare triple {2213#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {2213#false} is VALID [2018-11-23 11:59:42,424 INFO L273 TraceCheckUtils]: 29: Hoare triple {2213#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2213#false} is VALID [2018-11-23 11:59:42,424 INFO L256 TraceCheckUtils]: 30: Hoare triple {2213#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2213#false} is VALID [2018-11-23 11:59:42,424 INFO L273 TraceCheckUtils]: 31: Hoare triple {2213#false} ~cond := #in~cond; {2213#false} is VALID [2018-11-23 11:59:42,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {2213#false} assume !(0 == ~cond); {2213#false} is VALID [2018-11-23 11:59:42,424 INFO L273 TraceCheckUtils]: 33: Hoare triple {2213#false} assume true; {2213#false} is VALID [2018-11-23 11:59:42,425 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2213#false} {2213#false} #64#return; {2213#false} is VALID [2018-11-23 11:59:42,425 INFO L273 TraceCheckUtils]: 35: Hoare triple {2213#false} havoc #t~mem4;havoc #t~mem3; {2213#false} is VALID [2018-11-23 11:59:42,425 INFO L273 TraceCheckUtils]: 36: Hoare triple {2213#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2213#false} is VALID [2018-11-23 11:59:42,425 INFO L273 TraceCheckUtils]: 37: Hoare triple {2213#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2213#false} is VALID [2018-11-23 11:59:42,426 INFO L256 TraceCheckUtils]: 38: Hoare triple {2213#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2213#false} is VALID [2018-11-23 11:59:42,426 INFO L273 TraceCheckUtils]: 39: Hoare triple {2213#false} ~cond := #in~cond; {2213#false} is VALID [2018-11-23 11:59:42,426 INFO L273 TraceCheckUtils]: 40: Hoare triple {2213#false} assume !(0 == ~cond); {2213#false} is VALID [2018-11-23 11:59:42,426 INFO L273 TraceCheckUtils]: 41: Hoare triple {2213#false} assume true; {2213#false} is VALID [2018-11-23 11:59:42,426 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2213#false} {2213#false} #64#return; {2213#false} is VALID [2018-11-23 11:59:42,426 INFO L273 TraceCheckUtils]: 43: Hoare triple {2213#false} havoc #t~mem4;havoc #t~mem3; {2213#false} is VALID [2018-11-23 11:59:42,426 INFO L273 TraceCheckUtils]: 44: Hoare triple {2213#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2213#false} is VALID [2018-11-23 11:59:42,427 INFO L273 TraceCheckUtils]: 45: Hoare triple {2213#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2213#false} is VALID [2018-11-23 11:59:42,427 INFO L256 TraceCheckUtils]: 46: Hoare triple {2213#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2213#false} is VALID [2018-11-23 11:59:42,427 INFO L273 TraceCheckUtils]: 47: Hoare triple {2213#false} ~cond := #in~cond; {2213#false} is VALID [2018-11-23 11:59:42,427 INFO L273 TraceCheckUtils]: 48: Hoare triple {2213#false} assume 0 == ~cond; {2213#false} is VALID [2018-11-23 11:59:42,427 INFO L273 TraceCheckUtils]: 49: Hoare triple {2213#false} assume !false; {2213#false} is VALID [2018-11-23 11:59:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:59:42,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:42,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:59:42,449 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-23 11:59:42,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:42,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:59:42,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:42,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:59:42,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:59:42,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:42,497 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 11 states. [2018-11-23 11:59:42,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:42,759 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-23 11:59:42,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:59:42,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-23 11:59:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2018-11-23 11:59:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2018-11-23 11:59:42,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 57 transitions. [2018-11-23 11:59:42,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:42,818 INFO L225 Difference]: With dead ends: 83 [2018-11-23 11:59:42,818 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:59:42,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:42,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:59:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-23 11:59:42,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:42,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-23 11:59:42,943 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-23 11:59:42,943 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-23 11:59:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:42,945 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 11:59:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 11:59:42,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:42,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:42,946 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-23 11:59:42,946 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-23 11:59:42,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:42,947 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 11:59:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 11:59:42,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:42,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:42,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:42,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:59:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-23 11:59:42,950 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2018-11-23 11:59:42,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:42,950 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-23 11:59:42,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:59:42,950 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 11:59:42,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:59:42,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:42,951 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:42,951 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:42,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:42,951 INFO L82 PathProgramCache]: Analyzing trace with hash -7137914, now seen corresponding path program 5 times [2018-11-23 11:59:42,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:42,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:42,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:42,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:42,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:43,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {2680#true} call ULTIMATE.init(); {2680#true} is VALID [2018-11-23 11:59:43,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {2680#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2680#true} is VALID [2018-11-23 11:59:43,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {2680#true} assume true; {2680#true} is VALID [2018-11-23 11:59:43,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2680#true} {2680#true} #60#return; {2680#true} is VALID [2018-11-23 11:59:43,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {2680#true} call #t~ret5 := main(); {2680#true} is VALID [2018-11-23 11:59:43,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {2680#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {2682#(= main_~i~0 0)} is VALID [2018-11-23 11:59:43,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {2682#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2682#(= main_~i~0 0)} is VALID [2018-11-23 11:59:43,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {2682#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2682#(= main_~i~0 0)} is VALID [2018-11-23 11:59:43,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {2682#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2683#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:43,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {2683#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2683#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:43,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {2683#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2683#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:43,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {2683#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2684#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {2684#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2684#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {2684#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2684#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {2684#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2685#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {2685#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2685#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {2685#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2685#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {2685#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2686#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {2686#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2686#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,226 INFO L273 TraceCheckUtils]: 19: Hoare triple {2686#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2686#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {2686#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2687#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,227 INFO L273 TraceCheckUtils]: 21: Hoare triple {2687#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2687#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,228 INFO L273 TraceCheckUtils]: 22: Hoare triple {2687#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2687#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,228 INFO L273 TraceCheckUtils]: 23: Hoare triple {2687#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2688#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,229 INFO L273 TraceCheckUtils]: 24: Hoare triple {2688#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2688#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,229 INFO L273 TraceCheckUtils]: 25: Hoare triple {2688#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2688#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {2688#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2689#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {2689#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2689#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {2689#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2689#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {2689#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2690#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:43,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {2690#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2681#false} is VALID [2018-11-23 11:59:43,233 INFO L273 TraceCheckUtils]: 31: Hoare triple {2681#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {2681#false} is VALID [2018-11-23 11:59:43,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {2681#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2681#false} is VALID [2018-11-23 11:59:43,233 INFO L256 TraceCheckUtils]: 33: Hoare triple {2681#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2680#true} is VALID [2018-11-23 11:59:43,234 INFO L273 TraceCheckUtils]: 34: Hoare triple {2680#true} ~cond := #in~cond; {2680#true} is VALID [2018-11-23 11:59:43,234 INFO L273 TraceCheckUtils]: 35: Hoare triple {2680#true} assume !(0 == ~cond); {2680#true} is VALID [2018-11-23 11:59:43,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {2680#true} assume true; {2680#true} is VALID [2018-11-23 11:59:43,234 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2680#true} {2681#false} #64#return; {2681#false} is VALID [2018-11-23 11:59:43,235 INFO L273 TraceCheckUtils]: 38: Hoare triple {2681#false} havoc #t~mem4;havoc #t~mem3; {2681#false} is VALID [2018-11-23 11:59:43,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {2681#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2681#false} is VALID [2018-11-23 11:59:43,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {2681#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2681#false} is VALID [2018-11-23 11:59:43,236 INFO L256 TraceCheckUtils]: 41: Hoare triple {2681#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2680#true} is VALID [2018-11-23 11:59:43,236 INFO L273 TraceCheckUtils]: 42: Hoare triple {2680#true} ~cond := #in~cond; {2680#true} is VALID [2018-11-23 11:59:43,236 INFO L273 TraceCheckUtils]: 43: Hoare triple {2680#true} assume !(0 == ~cond); {2680#true} is VALID [2018-11-23 11:59:43,236 INFO L273 TraceCheckUtils]: 44: Hoare triple {2680#true} assume true; {2680#true} is VALID [2018-11-23 11:59:43,236 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2680#true} {2681#false} #64#return; {2681#false} is VALID [2018-11-23 11:59:43,236 INFO L273 TraceCheckUtils]: 46: Hoare triple {2681#false} havoc #t~mem4;havoc #t~mem3; {2681#false} is VALID [2018-11-23 11:59:43,237 INFO L273 TraceCheckUtils]: 47: Hoare triple {2681#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2681#false} is VALID [2018-11-23 11:59:43,237 INFO L273 TraceCheckUtils]: 48: Hoare triple {2681#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2681#false} is VALID [2018-11-23 11:59:43,237 INFO L256 TraceCheckUtils]: 49: Hoare triple {2681#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2681#false} is VALID [2018-11-23 11:59:43,237 INFO L273 TraceCheckUtils]: 50: Hoare triple {2681#false} ~cond := #in~cond; {2681#false} is VALID [2018-11-23 11:59:43,237 INFO L273 TraceCheckUtils]: 51: Hoare triple {2681#false} assume 0 == ~cond; {2681#false} is VALID [2018-11-23 11:59:43,238 INFO L273 TraceCheckUtils]: 52: Hoare triple {2681#false} assume !false; {2681#false} is VALID [2018-11-23 11:59:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:59:43,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:43,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:43,255 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:43,328 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 11:59:43,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:43,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:43,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {2680#true} call ULTIMATE.init(); {2680#true} is VALID [2018-11-23 11:59:43,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {2680#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2680#true} is VALID [2018-11-23 11:59:43,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {2680#true} assume true; {2680#true} is VALID [2018-11-23 11:59:43,656 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2680#true} {2680#true} #60#return; {2680#true} is VALID [2018-11-23 11:59:43,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {2680#true} call #t~ret5 := main(); {2680#true} is VALID [2018-11-23 11:59:43,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {2680#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {2709#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:43,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {2709#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2709#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:43,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {2709#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2709#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:43,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {2709#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2683#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:43,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {2683#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2683#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:43,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {2683#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2683#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:43,659 INFO L273 TraceCheckUtils]: 11: Hoare triple {2683#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2684#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,659 INFO L273 TraceCheckUtils]: 12: Hoare triple {2684#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2684#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {2684#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2684#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {2684#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2685#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {2685#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2685#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,693 INFO L273 TraceCheckUtils]: 16: Hoare triple {2685#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2685#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,697 INFO L273 TraceCheckUtils]: 17: Hoare triple {2685#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2686#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,698 INFO L273 TraceCheckUtils]: 18: Hoare triple {2686#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2686#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,698 INFO L273 TraceCheckUtils]: 19: Hoare triple {2686#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2686#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,699 INFO L273 TraceCheckUtils]: 20: Hoare triple {2686#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2687#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {2687#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2687#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,700 INFO L273 TraceCheckUtils]: 22: Hoare triple {2687#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2687#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,700 INFO L273 TraceCheckUtils]: 23: Hoare triple {2687#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2688#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {2688#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2688#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,701 INFO L273 TraceCheckUtils]: 25: Hoare triple {2688#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2688#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,701 INFO L273 TraceCheckUtils]: 26: Hoare triple {2688#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2689#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,702 INFO L273 TraceCheckUtils]: 27: Hoare triple {2689#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2689#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,702 INFO L273 TraceCheckUtils]: 28: Hoare triple {2689#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2689#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,703 INFO L273 TraceCheckUtils]: 29: Hoare triple {2689#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2690#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:43,703 INFO L273 TraceCheckUtils]: 30: Hoare triple {2690#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2681#false} is VALID [2018-11-23 11:59:43,704 INFO L273 TraceCheckUtils]: 31: Hoare triple {2681#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {2681#false} is VALID [2018-11-23 11:59:43,704 INFO L273 TraceCheckUtils]: 32: Hoare triple {2681#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2681#false} is VALID [2018-11-23 11:59:43,704 INFO L256 TraceCheckUtils]: 33: Hoare triple {2681#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2681#false} is VALID [2018-11-23 11:59:43,704 INFO L273 TraceCheckUtils]: 34: Hoare triple {2681#false} ~cond := #in~cond; {2681#false} is VALID [2018-11-23 11:59:43,705 INFO L273 TraceCheckUtils]: 35: Hoare triple {2681#false} assume !(0 == ~cond); {2681#false} is VALID [2018-11-23 11:59:43,705 INFO L273 TraceCheckUtils]: 36: Hoare triple {2681#false} assume true; {2681#false} is VALID [2018-11-23 11:59:43,705 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2681#false} {2681#false} #64#return; {2681#false} is VALID [2018-11-23 11:59:43,706 INFO L273 TraceCheckUtils]: 38: Hoare triple {2681#false} havoc #t~mem4;havoc #t~mem3; {2681#false} is VALID [2018-11-23 11:59:43,706 INFO L273 TraceCheckUtils]: 39: Hoare triple {2681#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2681#false} is VALID [2018-11-23 11:59:43,706 INFO L273 TraceCheckUtils]: 40: Hoare triple {2681#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2681#false} is VALID [2018-11-23 11:59:43,707 INFO L256 TraceCheckUtils]: 41: Hoare triple {2681#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2681#false} is VALID [2018-11-23 11:59:43,707 INFO L273 TraceCheckUtils]: 42: Hoare triple {2681#false} ~cond := #in~cond; {2681#false} is VALID [2018-11-23 11:59:43,707 INFO L273 TraceCheckUtils]: 43: Hoare triple {2681#false} assume !(0 == ~cond); {2681#false} is VALID [2018-11-23 11:59:43,707 INFO L273 TraceCheckUtils]: 44: Hoare triple {2681#false} assume true; {2681#false} is VALID [2018-11-23 11:59:43,707 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2681#false} {2681#false} #64#return; {2681#false} is VALID [2018-11-23 11:59:43,707 INFO L273 TraceCheckUtils]: 46: Hoare triple {2681#false} havoc #t~mem4;havoc #t~mem3; {2681#false} is VALID [2018-11-23 11:59:43,708 INFO L273 TraceCheckUtils]: 47: Hoare triple {2681#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2681#false} is VALID [2018-11-23 11:59:43,708 INFO L273 TraceCheckUtils]: 48: Hoare triple {2681#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2681#false} is VALID [2018-11-23 11:59:43,708 INFO L256 TraceCheckUtils]: 49: Hoare triple {2681#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2681#false} is VALID [2018-11-23 11:59:43,708 INFO L273 TraceCheckUtils]: 50: Hoare triple {2681#false} ~cond := #in~cond; {2681#false} is VALID [2018-11-23 11:59:43,708 INFO L273 TraceCheckUtils]: 51: Hoare triple {2681#false} assume 0 == ~cond; {2681#false} is VALID [2018-11-23 11:59:43,708 INFO L273 TraceCheckUtils]: 52: Hoare triple {2681#false} assume !false; {2681#false} is VALID [2018-11-23 11:59:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:59:43,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:43,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:59:43,733 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 11:59:43,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:43,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:59:43,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:43,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:43,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:43,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:43,815 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 12 states. [2018-11-23 11:59:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:44,172 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-23 11:59:44,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:59:44,172 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 11:59:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2018-11-23 11:59:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2018-11-23 11:59:44,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 60 transitions. [2018-11-23 11:59:44,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:44,261 INFO L225 Difference]: With dead ends: 86 [2018-11-23 11:59:44,262 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:59:44,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 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-23 11:59:44,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:59:44,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 11:59:44,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:44,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 11:59:44,393 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 11:59:44,394 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 11:59:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:44,396 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 11:59:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 11:59:44,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:44,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:44,397 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 11:59:44,397 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 11:59:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:44,398 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 11:59:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 11:59:44,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:44,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:44,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:44,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:59:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-23 11:59:44,400 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2018-11-23 11:59:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:44,400 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-23 11:59:44,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 11:59:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:59:44,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:44,401 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:44,401 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:44,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:44,402 INFO L82 PathProgramCache]: Analyzing trace with hash 944449864, now seen corresponding path program 6 times [2018-11-23 11:59:44,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:44,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:44,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:44,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:44,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:44,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {3172#true} call ULTIMATE.init(); {3172#true} is VALID [2018-11-23 11:59:44,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {3172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3172#true} is VALID [2018-11-23 11:59:44,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {3172#true} assume true; {3172#true} is VALID [2018-11-23 11:59:44,705 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3172#true} {3172#true} #60#return; {3172#true} is VALID [2018-11-23 11:59:44,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {3172#true} call #t~ret5 := main(); {3172#true} is VALID [2018-11-23 11:59:44,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {3172#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {3174#(= main_~i~0 0)} is VALID [2018-11-23 11:59:44,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {3174#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3174#(= main_~i~0 0)} is VALID [2018-11-23 11:59:44,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {3174#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3174#(= main_~i~0 0)} is VALID [2018-11-23 11:59:44,708 INFO L273 TraceCheckUtils]: 8: Hoare triple {3174#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3175#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:44,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {3175#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3175#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:44,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {3175#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3175#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:44,711 INFO L273 TraceCheckUtils]: 11: Hoare triple {3175#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3176#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:44,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {3176#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3176#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:44,713 INFO L273 TraceCheckUtils]: 13: Hoare triple {3176#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3176#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:44,715 INFO L273 TraceCheckUtils]: 14: Hoare triple {3176#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3177#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:44,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {3177#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3177#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:44,717 INFO L273 TraceCheckUtils]: 16: Hoare triple {3177#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3177#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:44,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {3177#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3178#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:44,720 INFO L273 TraceCheckUtils]: 18: Hoare triple {3178#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3178#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:44,720 INFO L273 TraceCheckUtils]: 19: Hoare triple {3178#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3178#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:44,722 INFO L273 TraceCheckUtils]: 20: Hoare triple {3178#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3179#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:44,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {3179#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3179#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:44,722 INFO L273 TraceCheckUtils]: 22: Hoare triple {3179#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3179#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:44,723 INFO L273 TraceCheckUtils]: 23: Hoare triple {3179#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3180#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:44,724 INFO L273 TraceCheckUtils]: 24: Hoare triple {3180#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3180#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:44,724 INFO L273 TraceCheckUtils]: 25: Hoare triple {3180#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3180#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:44,725 INFO L273 TraceCheckUtils]: 26: Hoare triple {3180#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3181#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:44,725 INFO L273 TraceCheckUtils]: 27: Hoare triple {3181#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3181#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:44,725 INFO L273 TraceCheckUtils]: 28: Hoare triple {3181#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3181#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:44,726 INFO L273 TraceCheckUtils]: 29: Hoare triple {3181#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3182#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:44,727 INFO L273 TraceCheckUtils]: 30: Hoare triple {3182#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3182#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:44,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {3182#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3182#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:44,728 INFO L273 TraceCheckUtils]: 32: Hoare triple {3182#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3183#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:44,729 INFO L273 TraceCheckUtils]: 33: Hoare triple {3183#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3173#false} is VALID [2018-11-23 11:59:44,729 INFO L273 TraceCheckUtils]: 34: Hoare triple {3173#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {3173#false} is VALID [2018-11-23 11:59:44,730 INFO L273 TraceCheckUtils]: 35: Hoare triple {3173#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3173#false} is VALID [2018-11-23 11:59:44,730 INFO L256 TraceCheckUtils]: 36: Hoare triple {3173#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3172#true} is VALID [2018-11-23 11:59:44,730 INFO L273 TraceCheckUtils]: 37: Hoare triple {3172#true} ~cond := #in~cond; {3172#true} is VALID [2018-11-23 11:59:44,730 INFO L273 TraceCheckUtils]: 38: Hoare triple {3172#true} assume !(0 == ~cond); {3172#true} is VALID [2018-11-23 11:59:44,731 INFO L273 TraceCheckUtils]: 39: Hoare triple {3172#true} assume true; {3172#true} is VALID [2018-11-23 11:59:44,731 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3172#true} {3173#false} #64#return; {3173#false} is VALID [2018-11-23 11:59:44,731 INFO L273 TraceCheckUtils]: 41: Hoare triple {3173#false} havoc #t~mem4;havoc #t~mem3; {3173#false} is VALID [2018-11-23 11:59:44,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {3173#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3173#false} is VALID [2018-11-23 11:59:44,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {3173#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3173#false} is VALID [2018-11-23 11:59:44,732 INFO L256 TraceCheckUtils]: 44: Hoare triple {3173#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3172#true} is VALID [2018-11-23 11:59:44,732 INFO L273 TraceCheckUtils]: 45: Hoare triple {3172#true} ~cond := #in~cond; {3172#true} is VALID [2018-11-23 11:59:44,732 INFO L273 TraceCheckUtils]: 46: Hoare triple {3172#true} assume !(0 == ~cond); {3172#true} is VALID [2018-11-23 11:59:44,732 INFO L273 TraceCheckUtils]: 47: Hoare triple {3172#true} assume true; {3172#true} is VALID [2018-11-23 11:59:44,732 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {3172#true} {3173#false} #64#return; {3173#false} is VALID [2018-11-23 11:59:44,732 INFO L273 TraceCheckUtils]: 49: Hoare triple {3173#false} havoc #t~mem4;havoc #t~mem3; {3173#false} is VALID [2018-11-23 11:59:44,733 INFO L273 TraceCheckUtils]: 50: Hoare triple {3173#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3173#false} is VALID [2018-11-23 11:59:44,733 INFO L273 TraceCheckUtils]: 51: Hoare triple {3173#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3173#false} is VALID [2018-11-23 11:59:44,733 INFO L256 TraceCheckUtils]: 52: Hoare triple {3173#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3173#false} is VALID [2018-11-23 11:59:44,733 INFO L273 TraceCheckUtils]: 53: Hoare triple {3173#false} ~cond := #in~cond; {3173#false} is VALID [2018-11-23 11:59:44,733 INFO L273 TraceCheckUtils]: 54: Hoare triple {3173#false} assume 0 == ~cond; {3173#false} is VALID [2018-11-23 11:59:44,733 INFO L273 TraceCheckUtils]: 55: Hoare triple {3173#false} assume !false; {3173#false} is VALID [2018-11-23 11:59:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 4 proven. 117 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:59:44,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:44,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:44,747 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:44,780 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-23 11:59:44,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:44,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:44,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:59:44,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:59:44,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:59:44,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-23 11:59:47,414 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8)))) is different from true [2018-11-23 11:59:49,555 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)))) is different from true [2018-11-23 11:59:49,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 11:59:49,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 11:59:49,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:59:49,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:59:49,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:59:49,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:59:49,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:59:49,844 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 11:59:49,847 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:59:49,847 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#b~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 8)) (.cse1 (select (select |#memory_int| |main_~#b~0.base|) 8))) (and (= .cse0 .cse1) (= .cse0 |main_#t~mem3|) (= |main_#t~mem4| .cse1) (not (= |main_~#b~0.base| |main_~#a~0.base|)))) [2018-11-23 11:59:49,847 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem4| |main_#t~mem3|) [2018-11-23 11:59:49,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {3172#true} call ULTIMATE.init(); {3172#true} is VALID [2018-11-23 11:59:49,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {3172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3172#true} is VALID [2018-11-23 11:59:49,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {3172#true} assume true; {3172#true} is VALID [2018-11-23 11:59:49,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3172#true} {3172#true} #60#return; {3172#true} is VALID [2018-11-23 11:59:49,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {3172#true} call #t~ret5 := main(); {3172#true} is VALID [2018-11-23 11:59:49,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {3172#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {3202#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {3202#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3202#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {3202#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3202#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {3202#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3212#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,903 INFO L273 TraceCheckUtils]: 9: Hoare triple {3212#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3212#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {3212#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3212#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {3212#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3222#(and (= 1 main_~rv~0) (= main_~i~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {3222#(and (= 1 main_~rv~0) (= main_~i~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3226#(and (= 1 main_~rv~0) (= |main_#t~mem0| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) |main_#t~mem1|) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {3226#(and (= 1 main_~rv~0) (= |main_#t~mem0| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) |main_#t~mem1|) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,908 INFO L273 TraceCheckUtils]: 14: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,909 INFO L273 TraceCheckUtils]: 15: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,910 INFO L273 TraceCheckUtils]: 16: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,911 INFO L273 TraceCheckUtils]: 17: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,913 INFO L273 TraceCheckUtils]: 19: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,914 INFO L273 TraceCheckUtils]: 20: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,915 INFO L273 TraceCheckUtils]: 21: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,917 INFO L273 TraceCheckUtils]: 24: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,934 INFO L273 TraceCheckUtils]: 25: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,942 INFO L273 TraceCheckUtils]: 26: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,942 INFO L273 TraceCheckUtils]: 27: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,943 INFO L273 TraceCheckUtils]: 28: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,944 INFO L273 TraceCheckUtils]: 29: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,944 INFO L273 TraceCheckUtils]: 30: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,945 INFO L273 TraceCheckUtils]: 31: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,945 INFO L273 TraceCheckUtils]: 32: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,946 INFO L273 TraceCheckUtils]: 33: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < 100000); {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,947 INFO L273 TraceCheckUtils]: 34: Hoare triple {3230#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {3294#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,948 INFO L273 TraceCheckUtils]: 35: Hoare triple {3294#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3294#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,950 INFO L256 TraceCheckUtils]: 36: Hoare triple {3294#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3301#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} is VALID [2018-11-23 11:59:49,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {3301#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} ~cond := #in~cond; {3301#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} is VALID [2018-11-23 11:59:49,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {3301#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} assume !(0 == ~cond); {3301#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} is VALID [2018-11-23 11:59:49,952 INFO L273 TraceCheckUtils]: 39: Hoare triple {3301#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} assume true; {3301#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} is VALID [2018-11-23 11:59:49,953 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3301#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} {3294#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #64#return; {3294#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,954 INFO L273 TraceCheckUtils]: 41: Hoare triple {3294#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} havoc #t~mem4;havoc #t~mem3; {3294#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,955 INFO L273 TraceCheckUtils]: 42: Hoare triple {3294#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3320#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,956 INFO L273 TraceCheckUtils]: 43: Hoare triple {3320#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3320#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,958 INFO L256 TraceCheckUtils]: 44: Hoare triple {3320#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3327#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-23 11:59:49,959 INFO L273 TraceCheckUtils]: 45: Hoare triple {3327#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} ~cond := #in~cond; {3327#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-23 11:59:49,959 INFO L273 TraceCheckUtils]: 46: Hoare triple {3327#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} assume !(0 == ~cond); {3327#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-23 11:59:49,960 INFO L273 TraceCheckUtils]: 47: Hoare triple {3327#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} assume true; {3327#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-23 11:59:49,961 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {3327#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} {3320#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #64#return; {3320#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,974 INFO L273 TraceCheckUtils]: 49: Hoare triple {3320#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} havoc #t~mem4;havoc #t~mem3; {3320#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,975 INFO L273 TraceCheckUtils]: 50: Hoare triple {3320#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3346#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:59:49,976 INFO L273 TraceCheckUtils]: 51: Hoare triple {3346#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3350#(= |main_#t~mem4| |main_#t~mem3|)} is VALID [2018-11-23 11:59:49,977 INFO L256 TraceCheckUtils]: 52: Hoare triple {3350#(= |main_#t~mem4| |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3354#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:59:49,977 INFO L273 TraceCheckUtils]: 53: Hoare triple {3354#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3358#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:59:49,977 INFO L273 TraceCheckUtils]: 54: Hoare triple {3358#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3173#false} is VALID [2018-11-23 11:59:49,978 INFO L273 TraceCheckUtils]: 55: Hoare triple {3173#false} assume !false; {3173#false} is VALID [2018-11-23 11:59:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 57 trivial. 8 not checked. [2018-11-23 11:59:50,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:50,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-11-23 11:59:50,012 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-11-23 11:59:50,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:50,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:59:50,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:50,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:59:50,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:59:50,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=393, Unknown=2, NotChecked=86, Total=600 [2018-11-23 11:59:50,122 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 25 states. [2018-11-23 12:01:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:36,526 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-11-23 12:01:36,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:01:36,527 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-11-23 12:01:36,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:01:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 88 transitions. [2018-11-23 12:01:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:01:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 88 transitions. [2018-11-23 12:01:36,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 88 transitions. [2018-11-23 12:01:36,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:36,676 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:01:36,676 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:01:36,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=232, Invalid=964, Unknown=2, NotChecked=134, Total=1332 [2018-11-23 12:01:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:01:36,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-11-23 12:01:36,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:36,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 70 states. [2018-11-23 12:01:36,948 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 70 states. [2018-11-23 12:01:36,948 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 70 states. [2018-11-23 12:01:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:36,951 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-11-23 12:01:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-23 12:01:36,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:36,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:36,952 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 74 states. [2018-11-23 12:01:36,952 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 74 states. [2018-11-23 12:01:36,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:36,954 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-11-23 12:01:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-23 12:01:36,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:36,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:36,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:36,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:01:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-11-23 12:01:36,956 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 56 [2018-11-23 12:01:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:36,957 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-23 12:01:36,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:01:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-23 12:01:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:01:36,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:36,958 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:36,958 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:36,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:36,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1687323174, now seen corresponding path program 7 times [2018-11-23 12:01:36,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:36,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:36,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:36,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:36,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:37,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {3768#true} call ULTIMATE.init(); {3768#true} is VALID [2018-11-23 12:01:37,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {3768#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3768#true} is VALID [2018-11-23 12:01:37,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {3768#true} assume true; {3768#true} is VALID [2018-11-23 12:01:37,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3768#true} {3768#true} #60#return; {3768#true} is VALID [2018-11-23 12:01:37,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {3768#true} call #t~ret5 := main(); {3768#true} is VALID [2018-11-23 12:01:37,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {3768#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {3770#(= main_~i~0 0)} is VALID [2018-11-23 12:01:37,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {3770#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3770#(= main_~i~0 0)} is VALID [2018-11-23 12:01:37,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {3770#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3770#(= main_~i~0 0)} is VALID [2018-11-23 12:01:37,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {3770#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3771#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:37,407 INFO L273 TraceCheckUtils]: 9: Hoare triple {3771#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3771#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:37,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {3771#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3771#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:37,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {3771#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3772#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:37,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {3772#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3772#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:37,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {3772#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3772#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:37,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {3772#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3773#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:37,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {3773#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3773#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:37,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {3773#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3773#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:37,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {3773#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3774#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:37,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {3774#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3774#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:37,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {3774#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3774#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:37,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {3774#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3775#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:37,414 INFO L273 TraceCheckUtils]: 21: Hoare triple {3775#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3775#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:37,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {3775#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3775#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:37,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {3775#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3776#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:37,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {3776#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3776#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:37,416 INFO L273 TraceCheckUtils]: 25: Hoare triple {3776#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3776#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:37,417 INFO L273 TraceCheckUtils]: 26: Hoare triple {3776#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3777#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:37,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {3777#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3777#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:37,418 INFO L273 TraceCheckUtils]: 28: Hoare triple {3777#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3777#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:37,418 INFO L273 TraceCheckUtils]: 29: Hoare triple {3777#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3778#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:37,419 INFO L273 TraceCheckUtils]: 30: Hoare triple {3778#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3778#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:37,419 INFO L273 TraceCheckUtils]: 31: Hoare triple {3778#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3778#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:37,420 INFO L273 TraceCheckUtils]: 32: Hoare triple {3778#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3779#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:37,421 INFO L273 TraceCheckUtils]: 33: Hoare triple {3779#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3779#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:37,421 INFO L273 TraceCheckUtils]: 34: Hoare triple {3779#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3779#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:37,422 INFO L273 TraceCheckUtils]: 35: Hoare triple {3779#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3780#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:37,423 INFO L273 TraceCheckUtils]: 36: Hoare triple {3780#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3769#false} is VALID [2018-11-23 12:01:37,423 INFO L273 TraceCheckUtils]: 37: Hoare triple {3769#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {3769#false} is VALID [2018-11-23 12:01:37,423 INFO L273 TraceCheckUtils]: 38: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:01:37,423 INFO L256 TraceCheckUtils]: 39: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3768#true} is VALID [2018-11-23 12:01:37,423 INFO L273 TraceCheckUtils]: 40: Hoare triple {3768#true} ~cond := #in~cond; {3768#true} is VALID [2018-11-23 12:01:37,424 INFO L273 TraceCheckUtils]: 41: Hoare triple {3768#true} assume !(0 == ~cond); {3768#true} is VALID [2018-11-23 12:01:37,424 INFO L273 TraceCheckUtils]: 42: Hoare triple {3768#true} assume true; {3768#true} is VALID [2018-11-23 12:01:37,424 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {3768#true} {3769#false} #64#return; {3769#false} is VALID [2018-11-23 12:01:37,424 INFO L273 TraceCheckUtils]: 44: Hoare triple {3769#false} havoc #t~mem4;havoc #t~mem3; {3769#false} is VALID [2018-11-23 12:01:37,424 INFO L273 TraceCheckUtils]: 45: Hoare triple {3769#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3769#false} is VALID [2018-11-23 12:01:37,425 INFO L273 TraceCheckUtils]: 46: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:01:37,425 INFO L256 TraceCheckUtils]: 47: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3768#true} is VALID [2018-11-23 12:01:37,425 INFO L273 TraceCheckUtils]: 48: Hoare triple {3768#true} ~cond := #in~cond; {3768#true} is VALID [2018-11-23 12:01:37,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {3768#true} assume !(0 == ~cond); {3768#true} is VALID [2018-11-23 12:01:37,426 INFO L273 TraceCheckUtils]: 50: Hoare triple {3768#true} assume true; {3768#true} is VALID [2018-11-23 12:01:37,426 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3768#true} {3769#false} #64#return; {3769#false} is VALID [2018-11-23 12:01:37,426 INFO L273 TraceCheckUtils]: 52: Hoare triple {3769#false} havoc #t~mem4;havoc #t~mem3; {3769#false} is VALID [2018-11-23 12:01:37,427 INFO L273 TraceCheckUtils]: 53: Hoare triple {3769#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3769#false} is VALID [2018-11-23 12:01:37,427 INFO L273 TraceCheckUtils]: 54: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:01:37,427 INFO L256 TraceCheckUtils]: 55: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3768#true} is VALID [2018-11-23 12:01:37,427 INFO L273 TraceCheckUtils]: 56: Hoare triple {3768#true} ~cond := #in~cond; {3768#true} is VALID [2018-11-23 12:01:37,428 INFO L273 TraceCheckUtils]: 57: Hoare triple {3768#true} assume !(0 == ~cond); {3768#true} is VALID [2018-11-23 12:01:37,428 INFO L273 TraceCheckUtils]: 58: Hoare triple {3768#true} assume true; {3768#true} is VALID [2018-11-23 12:01:37,428 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3768#true} {3769#false} #64#return; {3769#false} is VALID [2018-11-23 12:01:37,428 INFO L273 TraceCheckUtils]: 60: Hoare triple {3769#false} havoc #t~mem4;havoc #t~mem3; {3769#false} is VALID [2018-11-23 12:01:37,428 INFO L273 TraceCheckUtils]: 61: Hoare triple {3769#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3769#false} is VALID [2018-11-23 12:01:37,428 INFO L273 TraceCheckUtils]: 62: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:01:37,429 INFO L256 TraceCheckUtils]: 63: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3769#false} is VALID [2018-11-23 12:01:37,429 INFO L273 TraceCheckUtils]: 64: Hoare triple {3769#false} ~cond := #in~cond; {3769#false} is VALID [2018-11-23 12:01:37,429 INFO L273 TraceCheckUtils]: 65: Hoare triple {3769#false} assume 0 == ~cond; {3769#false} is VALID [2018-11-23 12:01:37,429 INFO L273 TraceCheckUtils]: 66: Hoare triple {3769#false} assume !false; {3769#false} is VALID [2018-11-23 12:01:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 6 proven. 145 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:01:37,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:37,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:37,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:37,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:37,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {3768#true} call ULTIMATE.init(); {3768#true} is VALID [2018-11-23 12:01:37,603 INFO L273 TraceCheckUtils]: 1: Hoare triple {3768#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3768#true} is VALID [2018-11-23 12:01:37,603 INFO L273 TraceCheckUtils]: 2: Hoare triple {3768#true} assume true; {3768#true} is VALID [2018-11-23 12:01:37,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3768#true} {3768#true} #60#return; {3768#true} is VALID [2018-11-23 12:01:37,603 INFO L256 TraceCheckUtils]: 4: Hoare triple {3768#true} call #t~ret5 := main(); {3768#true} is VALID [2018-11-23 12:01:37,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {3768#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {3799#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:37,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {3799#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3799#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:37,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {3799#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3799#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:37,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {3799#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3771#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:37,605 INFO L273 TraceCheckUtils]: 9: Hoare triple {3771#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3771#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:37,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {3771#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3771#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:37,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {3771#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3772#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:37,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {3772#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3772#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:37,607 INFO L273 TraceCheckUtils]: 13: Hoare triple {3772#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3772#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:37,608 INFO L273 TraceCheckUtils]: 14: Hoare triple {3772#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3773#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:37,608 INFO L273 TraceCheckUtils]: 15: Hoare triple {3773#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3773#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:37,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {3773#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3773#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:37,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {3773#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3774#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:37,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {3774#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3774#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:37,636 INFO L273 TraceCheckUtils]: 19: Hoare triple {3774#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3774#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:37,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {3774#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3775#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:37,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {3775#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3775#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:37,674 INFO L273 TraceCheckUtils]: 22: Hoare triple {3775#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3775#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:37,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {3775#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3776#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:37,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {3776#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3776#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:37,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {3776#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3776#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:37,718 INFO L273 TraceCheckUtils]: 26: Hoare triple {3776#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3777#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:37,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {3777#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3777#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:37,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {3777#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3777#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:37,720 INFO L273 TraceCheckUtils]: 29: Hoare triple {3777#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3778#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:37,722 INFO L273 TraceCheckUtils]: 30: Hoare triple {3778#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3778#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:37,722 INFO L273 TraceCheckUtils]: 31: Hoare triple {3778#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3778#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:37,728 INFO L273 TraceCheckUtils]: 32: Hoare triple {3778#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3779#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:37,728 INFO L273 TraceCheckUtils]: 33: Hoare triple {3779#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3779#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:37,728 INFO L273 TraceCheckUtils]: 34: Hoare triple {3779#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3779#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:37,729 INFO L273 TraceCheckUtils]: 35: Hoare triple {3779#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3780#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:37,729 INFO L273 TraceCheckUtils]: 36: Hoare triple {3780#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3769#false} is VALID [2018-11-23 12:01:37,729 INFO L273 TraceCheckUtils]: 37: Hoare triple {3769#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {3769#false} is VALID [2018-11-23 12:01:37,730 INFO L273 TraceCheckUtils]: 38: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:01:37,730 INFO L256 TraceCheckUtils]: 39: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3769#false} is VALID [2018-11-23 12:01:37,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {3769#false} ~cond := #in~cond; {3769#false} is VALID [2018-11-23 12:01:37,730 INFO L273 TraceCheckUtils]: 41: Hoare triple {3769#false} assume !(0 == ~cond); {3769#false} is VALID [2018-11-23 12:01:37,730 INFO L273 TraceCheckUtils]: 42: Hoare triple {3769#false} assume true; {3769#false} is VALID [2018-11-23 12:01:37,730 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {3769#false} {3769#false} #64#return; {3769#false} is VALID [2018-11-23 12:01:37,730 INFO L273 TraceCheckUtils]: 44: Hoare triple {3769#false} havoc #t~mem4;havoc #t~mem3; {3769#false} is VALID [2018-11-23 12:01:37,730 INFO L273 TraceCheckUtils]: 45: Hoare triple {3769#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3769#false} is VALID [2018-11-23 12:01:37,730 INFO L273 TraceCheckUtils]: 46: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:01:37,731 INFO L256 TraceCheckUtils]: 47: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3769#false} is VALID [2018-11-23 12:01:37,731 INFO L273 TraceCheckUtils]: 48: Hoare triple {3769#false} ~cond := #in~cond; {3769#false} is VALID [2018-11-23 12:01:37,731 INFO L273 TraceCheckUtils]: 49: Hoare triple {3769#false} assume !(0 == ~cond); {3769#false} is VALID [2018-11-23 12:01:37,731 INFO L273 TraceCheckUtils]: 50: Hoare triple {3769#false} assume true; {3769#false} is VALID [2018-11-23 12:01:37,731 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3769#false} {3769#false} #64#return; {3769#false} is VALID [2018-11-23 12:01:37,731 INFO L273 TraceCheckUtils]: 52: Hoare triple {3769#false} havoc #t~mem4;havoc #t~mem3; {3769#false} is VALID [2018-11-23 12:01:37,731 INFO L273 TraceCheckUtils]: 53: Hoare triple {3769#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3769#false} is VALID [2018-11-23 12:01:37,731 INFO L273 TraceCheckUtils]: 54: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:01:37,732 INFO L256 TraceCheckUtils]: 55: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3769#false} is VALID [2018-11-23 12:01:37,732 INFO L273 TraceCheckUtils]: 56: Hoare triple {3769#false} ~cond := #in~cond; {3769#false} is VALID [2018-11-23 12:01:37,732 INFO L273 TraceCheckUtils]: 57: Hoare triple {3769#false} assume !(0 == ~cond); {3769#false} is VALID [2018-11-23 12:01:37,732 INFO L273 TraceCheckUtils]: 58: Hoare triple {3769#false} assume true; {3769#false} is VALID [2018-11-23 12:01:37,732 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3769#false} {3769#false} #64#return; {3769#false} is VALID [2018-11-23 12:01:37,732 INFO L273 TraceCheckUtils]: 60: Hoare triple {3769#false} havoc #t~mem4;havoc #t~mem3; {3769#false} is VALID [2018-11-23 12:01:37,732 INFO L273 TraceCheckUtils]: 61: Hoare triple {3769#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3769#false} is VALID [2018-11-23 12:01:37,732 INFO L273 TraceCheckUtils]: 62: Hoare triple {3769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3769#false} is VALID [2018-11-23 12:01:37,732 INFO L256 TraceCheckUtils]: 63: Hoare triple {3769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3769#false} is VALID [2018-11-23 12:01:37,733 INFO L273 TraceCheckUtils]: 64: Hoare triple {3769#false} ~cond := #in~cond; {3769#false} is VALID [2018-11-23 12:01:37,733 INFO L273 TraceCheckUtils]: 65: Hoare triple {3769#false} assume 0 == ~cond; {3769#false} is VALID [2018-11-23 12:01:37,733 INFO L273 TraceCheckUtils]: 66: Hoare triple {3769#false} assume !false; {3769#false} is VALID [2018-11-23 12:01:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:01:37,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:37,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:01:37,758 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 12:01:37,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:37,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:01:37,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:37,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:01:37,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:01:37,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:01:37,826 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 14 states. [2018-11-23 12:01:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:38,107 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-11-23 12:01:38,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:01:38,107 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 12:01:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:01:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2018-11-23 12:01:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:01:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2018-11-23 12:01:38,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2018-11-23 12:01:38,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:38,169 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:01:38,170 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 12:01:38,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:01:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 12:01:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-11-23 12:01:38,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:38,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 73 states. [2018-11-23 12:01:38,382 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 73 states. [2018-11-23 12:01:38,382 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 73 states. [2018-11-23 12:01:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:38,384 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-11-23 12:01:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-23 12:01:38,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:38,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:38,385 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 75 states. [2018-11-23 12:01:38,385 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 75 states. [2018-11-23 12:01:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:38,387 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-11-23 12:01:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-23 12:01:38,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:38,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:38,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:38,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 12:01:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-11-23 12:01:38,390 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 67 [2018-11-23 12:01:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:38,390 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-11-23 12:01:38,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:01:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-11-23 12:01:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:01:38,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:38,391 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:38,392 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:38,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:38,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1823549924, now seen corresponding path program 8 times [2018-11-23 12:01:38,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:38,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:38,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:38,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:38,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:38,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {4381#true} call ULTIMATE.init(); {4381#true} is VALID [2018-11-23 12:01:38,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {4381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4381#true} is VALID [2018-11-23 12:01:38,956 INFO L273 TraceCheckUtils]: 2: Hoare triple {4381#true} assume true; {4381#true} is VALID [2018-11-23 12:01:38,956 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4381#true} {4381#true} #60#return; {4381#true} is VALID [2018-11-23 12:01:38,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {4381#true} call #t~ret5 := main(); {4381#true} is VALID [2018-11-23 12:01:38,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {4381#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {4383#(= main_~i~0 0)} is VALID [2018-11-23 12:01:38,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {4383#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4383#(= main_~i~0 0)} is VALID [2018-11-23 12:01:38,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {4383#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4383#(= main_~i~0 0)} is VALID [2018-11-23 12:01:38,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {4383#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4384#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:38,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {4384#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4384#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:38,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {4384#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4384#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:38,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {4384#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4385#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:38,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {4385#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4385#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:38,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {4385#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4385#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:38,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {4385#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4386#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:38,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {4386#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4386#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:38,964 INFO L273 TraceCheckUtils]: 16: Hoare triple {4386#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4386#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:38,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {4386#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4387#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:38,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {4387#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4387#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:38,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {4387#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4387#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:38,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {4387#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4388#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:38,967 INFO L273 TraceCheckUtils]: 21: Hoare triple {4388#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4388#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:38,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {4388#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4388#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:38,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {4388#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4389#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:38,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {4389#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4389#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:38,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {4389#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4389#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:38,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {4389#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4390#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:38,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {4390#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4390#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:38,971 INFO L273 TraceCheckUtils]: 28: Hoare triple {4390#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4390#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:38,972 INFO L273 TraceCheckUtils]: 29: Hoare triple {4390#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4391#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:38,972 INFO L273 TraceCheckUtils]: 30: Hoare triple {4391#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4391#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:38,973 INFO L273 TraceCheckUtils]: 31: Hoare triple {4391#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4391#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:38,974 INFO L273 TraceCheckUtils]: 32: Hoare triple {4391#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4392#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:38,974 INFO L273 TraceCheckUtils]: 33: Hoare triple {4392#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4392#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:38,975 INFO L273 TraceCheckUtils]: 34: Hoare triple {4392#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4392#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:38,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {4392#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4393#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:38,976 INFO L273 TraceCheckUtils]: 36: Hoare triple {4393#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4393#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:38,977 INFO L273 TraceCheckUtils]: 37: Hoare triple {4393#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4393#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:38,977 INFO L273 TraceCheckUtils]: 38: Hoare triple {4393#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4394#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:38,978 INFO L273 TraceCheckUtils]: 39: Hoare triple {4394#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4382#false} is VALID [2018-11-23 12:01:38,978 INFO L273 TraceCheckUtils]: 40: Hoare triple {4382#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {4382#false} is VALID [2018-11-23 12:01:38,979 INFO L273 TraceCheckUtils]: 41: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:01:38,979 INFO L256 TraceCheckUtils]: 42: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4381#true} is VALID [2018-11-23 12:01:38,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {4381#true} ~cond := #in~cond; {4381#true} is VALID [2018-11-23 12:01:38,979 INFO L273 TraceCheckUtils]: 44: Hoare triple {4381#true} assume !(0 == ~cond); {4381#true} is VALID [2018-11-23 12:01:38,979 INFO L273 TraceCheckUtils]: 45: Hoare triple {4381#true} assume true; {4381#true} is VALID [2018-11-23 12:01:38,980 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {4381#true} {4382#false} #64#return; {4382#false} is VALID [2018-11-23 12:01:38,980 INFO L273 TraceCheckUtils]: 47: Hoare triple {4382#false} havoc #t~mem4;havoc #t~mem3; {4382#false} is VALID [2018-11-23 12:01:38,980 INFO L273 TraceCheckUtils]: 48: Hoare triple {4382#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4382#false} is VALID [2018-11-23 12:01:38,980 INFO L273 TraceCheckUtils]: 49: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:01:38,980 INFO L256 TraceCheckUtils]: 50: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4381#true} is VALID [2018-11-23 12:01:38,981 INFO L273 TraceCheckUtils]: 51: Hoare triple {4381#true} ~cond := #in~cond; {4381#true} is VALID [2018-11-23 12:01:38,981 INFO L273 TraceCheckUtils]: 52: Hoare triple {4381#true} assume !(0 == ~cond); {4381#true} is VALID [2018-11-23 12:01:38,981 INFO L273 TraceCheckUtils]: 53: Hoare triple {4381#true} assume true; {4381#true} is VALID [2018-11-23 12:01:38,981 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {4381#true} {4382#false} #64#return; {4382#false} is VALID [2018-11-23 12:01:38,981 INFO L273 TraceCheckUtils]: 55: Hoare triple {4382#false} havoc #t~mem4;havoc #t~mem3; {4382#false} is VALID [2018-11-23 12:01:38,982 INFO L273 TraceCheckUtils]: 56: Hoare triple {4382#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4382#false} is VALID [2018-11-23 12:01:38,982 INFO L273 TraceCheckUtils]: 57: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:01:38,982 INFO L256 TraceCheckUtils]: 58: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4381#true} is VALID [2018-11-23 12:01:38,982 INFO L273 TraceCheckUtils]: 59: Hoare triple {4381#true} ~cond := #in~cond; {4381#true} is VALID [2018-11-23 12:01:38,982 INFO L273 TraceCheckUtils]: 60: Hoare triple {4381#true} assume !(0 == ~cond); {4381#true} is VALID [2018-11-23 12:01:38,982 INFO L273 TraceCheckUtils]: 61: Hoare triple {4381#true} assume true; {4381#true} is VALID [2018-11-23 12:01:38,982 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {4381#true} {4382#false} #64#return; {4382#false} is VALID [2018-11-23 12:01:38,982 INFO L273 TraceCheckUtils]: 63: Hoare triple {4382#false} havoc #t~mem4;havoc #t~mem3; {4382#false} is VALID [2018-11-23 12:01:38,982 INFO L273 TraceCheckUtils]: 64: Hoare triple {4382#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4382#false} is VALID [2018-11-23 12:01:38,983 INFO L273 TraceCheckUtils]: 65: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:01:38,983 INFO L256 TraceCheckUtils]: 66: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4382#false} is VALID [2018-11-23 12:01:38,983 INFO L273 TraceCheckUtils]: 67: Hoare triple {4382#false} ~cond := #in~cond; {4382#false} is VALID [2018-11-23 12:01:38,983 INFO L273 TraceCheckUtils]: 68: Hoare triple {4382#false} assume 0 == ~cond; {4382#false} is VALID [2018-11-23 12:01:38,983 INFO L273 TraceCheckUtils]: 69: Hoare triple {4382#false} assume !false; {4382#false} is VALID [2018-11-23 12:01:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 6 proven. 176 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:01:38,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:38,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:38,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:01:39,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:01:39,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:39,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:39,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {4381#true} call ULTIMATE.init(); {4381#true} is VALID [2018-11-23 12:01:39,202 INFO L273 TraceCheckUtils]: 1: Hoare triple {4381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4381#true} is VALID [2018-11-23 12:01:39,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {4381#true} assume true; {4381#true} is VALID [2018-11-23 12:01:39,203 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4381#true} {4381#true} #60#return; {4381#true} is VALID [2018-11-23 12:01:39,203 INFO L256 TraceCheckUtils]: 4: Hoare triple {4381#true} call #t~ret5 := main(); {4381#true} is VALID [2018-11-23 12:01:39,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {4381#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {4413#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:39,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {4413#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4413#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:39,205 INFO L273 TraceCheckUtils]: 7: Hoare triple {4413#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4413#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:39,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {4413#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4384#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:39,206 INFO L273 TraceCheckUtils]: 9: Hoare triple {4384#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4384#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:39,206 INFO L273 TraceCheckUtils]: 10: Hoare triple {4384#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4384#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:39,207 INFO L273 TraceCheckUtils]: 11: Hoare triple {4384#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4385#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:39,208 INFO L273 TraceCheckUtils]: 12: Hoare triple {4385#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4385#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:39,209 INFO L273 TraceCheckUtils]: 13: Hoare triple {4385#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4385#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:39,209 INFO L273 TraceCheckUtils]: 14: Hoare triple {4385#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4386#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:39,210 INFO L273 TraceCheckUtils]: 15: Hoare triple {4386#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4386#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:39,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {4386#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4386#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:39,212 INFO L273 TraceCheckUtils]: 17: Hoare triple {4386#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4387#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:39,212 INFO L273 TraceCheckUtils]: 18: Hoare triple {4387#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4387#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:39,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {4387#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4387#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:39,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {4387#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4388#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:39,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {4388#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4388#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:39,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {4388#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4388#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:39,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {4388#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4389#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:39,216 INFO L273 TraceCheckUtils]: 24: Hoare triple {4389#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4389#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:39,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {4389#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4389#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:39,218 INFO L273 TraceCheckUtils]: 26: Hoare triple {4389#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4390#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:39,219 INFO L273 TraceCheckUtils]: 27: Hoare triple {4390#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4390#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:39,219 INFO L273 TraceCheckUtils]: 28: Hoare triple {4390#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4390#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:39,220 INFO L273 TraceCheckUtils]: 29: Hoare triple {4390#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4391#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:39,221 INFO L273 TraceCheckUtils]: 30: Hoare triple {4391#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4391#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:39,221 INFO L273 TraceCheckUtils]: 31: Hoare triple {4391#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4391#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:39,222 INFO L273 TraceCheckUtils]: 32: Hoare triple {4391#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4392#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:39,223 INFO L273 TraceCheckUtils]: 33: Hoare triple {4392#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4392#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:39,224 INFO L273 TraceCheckUtils]: 34: Hoare triple {4392#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4392#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:39,224 INFO L273 TraceCheckUtils]: 35: Hoare triple {4392#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4393#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:39,225 INFO L273 TraceCheckUtils]: 36: Hoare triple {4393#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4393#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:39,226 INFO L273 TraceCheckUtils]: 37: Hoare triple {4393#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4393#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:39,227 INFO L273 TraceCheckUtils]: 38: Hoare triple {4393#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4394#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:39,227 INFO L273 TraceCheckUtils]: 39: Hoare triple {4394#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4382#false} is VALID [2018-11-23 12:01:39,228 INFO L273 TraceCheckUtils]: 40: Hoare triple {4382#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {4382#false} is VALID [2018-11-23 12:01:39,228 INFO L273 TraceCheckUtils]: 41: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:01:39,228 INFO L256 TraceCheckUtils]: 42: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4382#false} is VALID [2018-11-23 12:01:39,228 INFO L273 TraceCheckUtils]: 43: Hoare triple {4382#false} ~cond := #in~cond; {4382#false} is VALID [2018-11-23 12:01:39,229 INFO L273 TraceCheckUtils]: 44: Hoare triple {4382#false} assume !(0 == ~cond); {4382#false} is VALID [2018-11-23 12:01:39,229 INFO L273 TraceCheckUtils]: 45: Hoare triple {4382#false} assume true; {4382#false} is VALID [2018-11-23 12:01:39,229 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {4382#false} {4382#false} #64#return; {4382#false} is VALID [2018-11-23 12:01:39,229 INFO L273 TraceCheckUtils]: 47: Hoare triple {4382#false} havoc #t~mem4;havoc #t~mem3; {4382#false} is VALID [2018-11-23 12:01:39,230 INFO L273 TraceCheckUtils]: 48: Hoare triple {4382#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4382#false} is VALID [2018-11-23 12:01:39,230 INFO L273 TraceCheckUtils]: 49: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:01:39,230 INFO L256 TraceCheckUtils]: 50: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4382#false} is VALID [2018-11-23 12:01:39,230 INFO L273 TraceCheckUtils]: 51: Hoare triple {4382#false} ~cond := #in~cond; {4382#false} is VALID [2018-11-23 12:01:39,231 INFO L273 TraceCheckUtils]: 52: Hoare triple {4382#false} assume !(0 == ~cond); {4382#false} is VALID [2018-11-23 12:01:39,231 INFO L273 TraceCheckUtils]: 53: Hoare triple {4382#false} assume true; {4382#false} is VALID [2018-11-23 12:01:39,231 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {4382#false} {4382#false} #64#return; {4382#false} is VALID [2018-11-23 12:01:39,232 INFO L273 TraceCheckUtils]: 55: Hoare triple {4382#false} havoc #t~mem4;havoc #t~mem3; {4382#false} is VALID [2018-11-23 12:01:39,232 INFO L273 TraceCheckUtils]: 56: Hoare triple {4382#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4382#false} is VALID [2018-11-23 12:01:39,232 INFO L273 TraceCheckUtils]: 57: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:01:39,232 INFO L256 TraceCheckUtils]: 58: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4382#false} is VALID [2018-11-23 12:01:39,232 INFO L273 TraceCheckUtils]: 59: Hoare triple {4382#false} ~cond := #in~cond; {4382#false} is VALID [2018-11-23 12:01:39,232 INFO L273 TraceCheckUtils]: 60: Hoare triple {4382#false} assume !(0 == ~cond); {4382#false} is VALID [2018-11-23 12:01:39,233 INFO L273 TraceCheckUtils]: 61: Hoare triple {4382#false} assume true; {4382#false} is VALID [2018-11-23 12:01:39,233 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {4382#false} {4382#false} #64#return; {4382#false} is VALID [2018-11-23 12:01:39,233 INFO L273 TraceCheckUtils]: 63: Hoare triple {4382#false} havoc #t~mem4;havoc #t~mem3; {4382#false} is VALID [2018-11-23 12:01:39,233 INFO L273 TraceCheckUtils]: 64: Hoare triple {4382#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4382#false} is VALID [2018-11-23 12:01:39,233 INFO L273 TraceCheckUtils]: 65: Hoare triple {4382#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4382#false} is VALID [2018-11-23 12:01:39,233 INFO L256 TraceCheckUtils]: 66: Hoare triple {4382#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4382#false} is VALID [2018-11-23 12:01:39,233 INFO L273 TraceCheckUtils]: 67: Hoare triple {4382#false} ~cond := #in~cond; {4382#false} is VALID [2018-11-23 12:01:39,234 INFO L273 TraceCheckUtils]: 68: Hoare triple {4382#false} assume 0 == ~cond; {4382#false} is VALID [2018-11-23 12:01:39,234 INFO L273 TraceCheckUtils]: 69: Hoare triple {4382#false} assume !false; {4382#false} is VALID [2018-11-23 12:01:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:01:39,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:39,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:01:39,259 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2018-11-23 12:01:39,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:39,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:01:39,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:39,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:01:39,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:01:39,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:01:39,328 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 15 states. [2018-11-23 12:01:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:39,789 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-23 12:01:39,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:01:39,790 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2018-11-23 12:01:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:01:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2018-11-23 12:01:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:01:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2018-11-23 12:01:39,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2018-11-23 12:01:40,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:40,673 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:01:40,673 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:01:40,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:01:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:01:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-23 12:01:40,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:40,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2018-11-23 12:01:40,932 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2018-11-23 12:01:40,932 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2018-11-23 12:01:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:40,935 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-11-23 12:01:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-23 12:01:40,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:40,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:40,935 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2018-11-23 12:01:40,936 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2018-11-23 12:01:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:40,937 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-11-23 12:01:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-23 12:01:40,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:40,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:40,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:40,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:01:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-11-23 12:01:40,961 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 70 [2018-11-23 12:01:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:40,962 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-11-23 12:01:40,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:01:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-11-23 12:01:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:01:40,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:40,963 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:40,963 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:40,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1410564454, now seen corresponding path program 9 times [2018-11-23 12:01:40,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:40,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:40,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:40,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:40,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:41,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {5018#true} call ULTIMATE.init(); {5018#true} is VALID [2018-11-23 12:01:41,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {5018#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5018#true} is VALID [2018-11-23 12:01:41,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {5018#true} assume true; {5018#true} is VALID [2018-11-23 12:01:41,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5018#true} {5018#true} #60#return; {5018#true} is VALID [2018-11-23 12:01:41,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {5018#true} call #t~ret5 := main(); {5018#true} is VALID [2018-11-23 12:01:41,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {5018#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {5020#(= main_~i~0 0)} is VALID [2018-11-23 12:01:41,593 INFO L273 TraceCheckUtils]: 6: Hoare triple {5020#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5020#(= main_~i~0 0)} is VALID [2018-11-23 12:01:41,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {5020#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5020#(= main_~i~0 0)} is VALID [2018-11-23 12:01:41,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {5020#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5021#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:41,595 INFO L273 TraceCheckUtils]: 9: Hoare triple {5021#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5021#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:41,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {5021#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5021#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:41,597 INFO L273 TraceCheckUtils]: 11: Hoare triple {5021#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5022#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:41,597 INFO L273 TraceCheckUtils]: 12: Hoare triple {5022#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5022#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:41,598 INFO L273 TraceCheckUtils]: 13: Hoare triple {5022#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5022#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:41,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {5022#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5023#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:41,599 INFO L273 TraceCheckUtils]: 15: Hoare triple {5023#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5023#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:41,599 INFO L273 TraceCheckUtils]: 16: Hoare triple {5023#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5023#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:41,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {5023#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5024#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:41,601 INFO L273 TraceCheckUtils]: 18: Hoare triple {5024#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5024#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:41,601 INFO L273 TraceCheckUtils]: 19: Hoare triple {5024#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5024#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:41,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {5024#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5025#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:41,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {5025#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5025#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:41,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {5025#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5025#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:41,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {5025#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5026#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:41,606 INFO L273 TraceCheckUtils]: 24: Hoare triple {5026#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5026#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:41,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {5026#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5026#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:41,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {5026#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5027#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:41,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {5027#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5027#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:41,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {5027#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5027#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:41,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {5027#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5028#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:41,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {5028#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5028#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:41,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {5028#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5028#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:41,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {5028#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5029#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:41,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {5029#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5029#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:41,615 INFO L273 TraceCheckUtils]: 34: Hoare triple {5029#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5029#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:41,615 INFO L273 TraceCheckUtils]: 35: Hoare triple {5029#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5030#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:41,617 INFO L273 TraceCheckUtils]: 36: Hoare triple {5030#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5030#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:41,617 INFO L273 TraceCheckUtils]: 37: Hoare triple {5030#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5030#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:41,620 INFO L273 TraceCheckUtils]: 38: Hoare triple {5030#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5031#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:41,620 INFO L273 TraceCheckUtils]: 39: Hoare triple {5031#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5031#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:41,622 INFO L273 TraceCheckUtils]: 40: Hoare triple {5031#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5031#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:41,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {5031#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5032#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:41,624 INFO L273 TraceCheckUtils]: 42: Hoare triple {5032#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5019#false} is VALID [2018-11-23 12:01:41,624 INFO L273 TraceCheckUtils]: 43: Hoare triple {5019#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {5019#false} is VALID [2018-11-23 12:01:41,624 INFO L273 TraceCheckUtils]: 44: Hoare triple {5019#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5019#false} is VALID [2018-11-23 12:01:41,624 INFO L256 TraceCheckUtils]: 45: Hoare triple {5019#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5018#true} is VALID [2018-11-23 12:01:41,624 INFO L273 TraceCheckUtils]: 46: Hoare triple {5018#true} ~cond := #in~cond; {5018#true} is VALID [2018-11-23 12:01:41,624 INFO L273 TraceCheckUtils]: 47: Hoare triple {5018#true} assume !(0 == ~cond); {5018#true} is VALID [2018-11-23 12:01:41,624 INFO L273 TraceCheckUtils]: 48: Hoare triple {5018#true} assume true; {5018#true} is VALID [2018-11-23 12:01:41,625 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {5018#true} {5019#false} #64#return; {5019#false} is VALID [2018-11-23 12:01:41,625 INFO L273 TraceCheckUtils]: 50: Hoare triple {5019#false} havoc #t~mem4;havoc #t~mem3; {5019#false} is VALID [2018-11-23 12:01:41,625 INFO L273 TraceCheckUtils]: 51: Hoare triple {5019#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5019#false} is VALID [2018-11-23 12:01:41,625 INFO L273 TraceCheckUtils]: 52: Hoare triple {5019#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5019#false} is VALID [2018-11-23 12:01:41,625 INFO L256 TraceCheckUtils]: 53: Hoare triple {5019#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5018#true} is VALID [2018-11-23 12:01:41,625 INFO L273 TraceCheckUtils]: 54: Hoare triple {5018#true} ~cond := #in~cond; {5018#true} is VALID [2018-11-23 12:01:41,625 INFO L273 TraceCheckUtils]: 55: Hoare triple {5018#true} assume !(0 == ~cond); {5018#true} is VALID [2018-11-23 12:01:41,625 INFO L273 TraceCheckUtils]: 56: Hoare triple {5018#true} assume true; {5018#true} is VALID [2018-11-23 12:01:41,626 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5018#true} {5019#false} #64#return; {5019#false} is VALID [2018-11-23 12:01:41,626 INFO L273 TraceCheckUtils]: 58: Hoare triple {5019#false} havoc #t~mem4;havoc #t~mem3; {5019#false} is VALID [2018-11-23 12:01:41,626 INFO L273 TraceCheckUtils]: 59: Hoare triple {5019#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5019#false} is VALID [2018-11-23 12:01:41,626 INFO L273 TraceCheckUtils]: 60: Hoare triple {5019#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5019#false} is VALID [2018-11-23 12:01:41,626 INFO L256 TraceCheckUtils]: 61: Hoare triple {5019#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5018#true} is VALID [2018-11-23 12:01:41,626 INFO L273 TraceCheckUtils]: 62: Hoare triple {5018#true} ~cond := #in~cond; {5018#true} is VALID [2018-11-23 12:01:41,626 INFO L273 TraceCheckUtils]: 63: Hoare triple {5018#true} assume !(0 == ~cond); {5018#true} is VALID [2018-11-23 12:01:41,626 INFO L273 TraceCheckUtils]: 64: Hoare triple {5018#true} assume true; {5018#true} is VALID [2018-11-23 12:01:41,626 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {5018#true} {5019#false} #64#return; {5019#false} is VALID [2018-11-23 12:01:41,627 INFO L273 TraceCheckUtils]: 66: Hoare triple {5019#false} havoc #t~mem4;havoc #t~mem3; {5019#false} is VALID [2018-11-23 12:01:41,627 INFO L273 TraceCheckUtils]: 67: Hoare triple {5019#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5019#false} is VALID [2018-11-23 12:01:41,627 INFO L273 TraceCheckUtils]: 68: Hoare triple {5019#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5019#false} is VALID [2018-11-23 12:01:41,627 INFO L256 TraceCheckUtils]: 69: Hoare triple {5019#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5019#false} is VALID [2018-11-23 12:01:41,627 INFO L273 TraceCheckUtils]: 70: Hoare triple {5019#false} ~cond := #in~cond; {5019#false} is VALID [2018-11-23 12:01:41,627 INFO L273 TraceCheckUtils]: 71: Hoare triple {5019#false} assume 0 == ~cond; {5019#false} is VALID [2018-11-23 12:01:41,627 INFO L273 TraceCheckUtils]: 72: Hoare triple {5019#false} assume !false; {5019#false} is VALID [2018-11-23 12:01:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 6 proven. 210 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:01:41,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:41,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:41,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:01:41,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:01:41,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:41,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:41,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:01:41,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:01:41,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:01:41,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-23 12:01:44,207 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 12) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 12)))) is different from true [2018-11-23 12:01:46,340 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 12) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) 12)) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|)))) is different from true [2018-11-23 12:01:48,509 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#a~0.base_BEFORE_CALL_6|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 12) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) 12)))) is different from true [2018-11-23 12:01:48,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 12:01:48,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 12:01:48,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:01:48,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:01:48,705 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:01:48,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:01:48,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:01:48,714 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 12:01:48,716 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:01:48,716 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#b~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 12)) (.cse1 (select (select |#memory_int| |main_~#b~0.base|) 12))) (and (= .cse0 |main_#t~mem3|) (= .cse1 |main_#t~mem4|) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= .cse0 .cse1))) [2018-11-23 12:01:48,716 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem4| |main_#t~mem3|) [2018-11-23 12:01:48,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {5018#true} call ULTIMATE.init(); {5018#true} is VALID [2018-11-23 12:01:48,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {5018#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5018#true} is VALID [2018-11-23 12:01:48,778 INFO L273 TraceCheckUtils]: 2: Hoare triple {5018#true} assume true; {5018#true} is VALID [2018-11-23 12:01:48,778 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5018#true} {5018#true} #60#return; {5018#true} is VALID [2018-11-23 12:01:48,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {5018#true} call #t~ret5 := main(); {5018#true} is VALID [2018-11-23 12:01:48,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {5018#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {5051#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,780 INFO L273 TraceCheckUtils]: 6: Hoare triple {5051#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5051#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {5051#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5051#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {5051#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {5061#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,782 INFO L273 TraceCheckUtils]: 9: Hoare triple {5061#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5061#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {5061#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5061#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {5061#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {5071#(and (= 1 main_~rv~0) (= main_~i~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {5071#(and (= 1 main_~rv~0) (= main_~i~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5071#(and (= 1 main_~rv~0) (= main_~i~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {5071#(and (= 1 main_~rv~0) (= main_~i~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5071#(and (= 1 main_~rv~0) (= main_~i~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {5071#(and (= 1 main_~rv~0) (= main_~i~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {5081#(and (= main_~i~0 3) (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,787 INFO L273 TraceCheckUtils]: 15: Hoare triple {5081#(and (= main_~i~0 3) (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5085#(and (= 1 main_~rv~0) (= |main_#t~mem0| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) |main_#t~mem1|) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {5085#(and (= 1 main_~rv~0) (= |main_#t~mem0| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) |main_#t~mem1|) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,795 INFO L273 TraceCheckUtils]: 22: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,796 INFO L273 TraceCheckUtils]: 23: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,804 INFO L273 TraceCheckUtils]: 30: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,806 INFO L273 TraceCheckUtils]: 32: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,808 INFO L273 TraceCheckUtils]: 33: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,809 INFO L273 TraceCheckUtils]: 34: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,810 INFO L273 TraceCheckUtils]: 35: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,811 INFO L273 TraceCheckUtils]: 36: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,812 INFO L273 TraceCheckUtils]: 37: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,813 INFO L273 TraceCheckUtils]: 38: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,814 INFO L273 TraceCheckUtils]: 39: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,815 INFO L273 TraceCheckUtils]: 40: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,816 INFO L273 TraceCheckUtils]: 41: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,817 INFO L273 TraceCheckUtils]: 42: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(~i~0 < 100000); {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,818 INFO L273 TraceCheckUtils]: 43: Hoare triple {5089#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {5171#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,820 INFO L273 TraceCheckUtils]: 44: Hoare triple {5171#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5171#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,821 INFO L256 TraceCheckUtils]: 45: Hoare triple {5171#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5178#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 12))))} is VALID [2018-11-23 12:01:48,822 INFO L273 TraceCheckUtils]: 46: Hoare triple {5178#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 12))))} ~cond := #in~cond; {5178#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 12))))} is VALID [2018-11-23 12:01:48,823 INFO L273 TraceCheckUtils]: 47: Hoare triple {5178#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 12))))} assume !(0 == ~cond); {5178#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 12))))} is VALID [2018-11-23 12:01:48,823 INFO L273 TraceCheckUtils]: 48: Hoare triple {5178#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 12))))} assume true; {5178#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 12))))} is VALID [2018-11-23 12:01:48,824 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {5178#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 12))))} {5171#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #64#return; {5171#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,825 INFO L273 TraceCheckUtils]: 50: Hoare triple {5171#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} havoc #t~mem4;havoc #t~mem3; {5171#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {5171#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5197#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,828 INFO L273 TraceCheckUtils]: 52: Hoare triple {5197#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5197#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,829 INFO L256 TraceCheckUtils]: 53: Hoare triple {5197#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5204#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) 12)) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|))))} is VALID [2018-11-23 12:01:48,830 INFO L273 TraceCheckUtils]: 54: Hoare triple {5204#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) 12)) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|))))} ~cond := #in~cond; {5204#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) 12)) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|))))} is VALID [2018-11-23 12:01:48,831 INFO L273 TraceCheckUtils]: 55: Hoare triple {5204#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) 12)) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|))))} assume !(0 == ~cond); {5204#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) 12)) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|))))} is VALID [2018-11-23 12:01:48,831 INFO L273 TraceCheckUtils]: 56: Hoare triple {5204#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) 12)) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|))))} assume true; {5204#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) 12)) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|))))} is VALID [2018-11-23 12:01:48,832 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5204#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) 12)) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|))))} {5197#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #64#return; {5197#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,833 INFO L273 TraceCheckUtils]: 58: Hoare triple {5197#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} havoc #t~mem4;havoc #t~mem3; {5197#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,834 INFO L273 TraceCheckUtils]: 59: Hoare triple {5197#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5223#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,835 INFO L273 TraceCheckUtils]: 60: Hoare triple {5223#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5223#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,837 INFO L256 TraceCheckUtils]: 61: Hoare triple {5223#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5230#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#a~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) 12))))} is VALID [2018-11-23 12:01:48,838 INFO L273 TraceCheckUtils]: 62: Hoare triple {5230#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#a~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) 12))))} ~cond := #in~cond; {5230#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#a~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) 12))))} is VALID [2018-11-23 12:01:48,838 INFO L273 TraceCheckUtils]: 63: Hoare triple {5230#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#a~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) 12))))} assume !(0 == ~cond); {5230#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#a~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) 12))))} is VALID [2018-11-23 12:01:48,839 INFO L273 TraceCheckUtils]: 64: Hoare triple {5230#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#a~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) 12))))} assume true; {5230#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#a~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) 12))))} is VALID [2018-11-23 12:01:48,840 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {5230#(exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#a~0.base_BEFORE_CALL_6|)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 12) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) 12))))} {5223#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #64#return; {5223#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,841 INFO L273 TraceCheckUtils]: 66: Hoare triple {5223#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} havoc #t~mem4;havoc #t~mem3; {5223#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,842 INFO L273 TraceCheckUtils]: 67: Hoare triple {5223#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5249#(and (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~x~0 3) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:01:48,843 INFO L273 TraceCheckUtils]: 68: Hoare triple {5249#(and (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~x~0 3) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5253#(= |main_#t~mem4| |main_#t~mem3|)} is VALID [2018-11-23 12:01:48,844 INFO L256 TraceCheckUtils]: 69: Hoare triple {5253#(= |main_#t~mem4| |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5257#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:01:48,845 INFO L273 TraceCheckUtils]: 70: Hoare triple {5257#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5261#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:01:48,846 INFO L273 TraceCheckUtils]: 71: Hoare triple {5261#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5019#false} is VALID [2018-11-23 12:01:48,846 INFO L273 TraceCheckUtils]: 72: Hoare triple {5019#false} assume !false; {5019#false} is VALID [2018-11-23 12:01:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 100 trivial. 18 not checked. [2018-11-23 12:01:48,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:48,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2018-11-23 12:01:48,892 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 73 [2018-11-23 12:01:48,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:48,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:01:49,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:49,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:01:49,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:01:49,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=582, Unknown=3, NotChecked=162, Total=930 [2018-11-23 12:01:49,021 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 31 states.