java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-programs/copysome1_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:54:14,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:54:14,723 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:54:14,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:54:14,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:54:14,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:54:14,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:54:14,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:54:14,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:54:14,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:54:14,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:54:14,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:54:14,752 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:54:14,755 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:54:14,759 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:54:14,760 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:54:14,762 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:54:14,764 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:54:14,774 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:54:14,775 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:54:14,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:54:14,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:54:14,787 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:54:14,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:54:14,788 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:54:14,788 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:54:14,790 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:54:14,793 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:54:14,794 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:54:14,795 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:54:14,795 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:54:14,795 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:54:14,796 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:54:14,796 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:54:14,797 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:54:14,797 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:54:14,799 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:54:14,824 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:54:14,824 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:54:14,825 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:54:14,825 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:54:14,830 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:54:14,830 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:54:14,830 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:54:14,830 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:54:14,831 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:54:14,831 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:54:14,831 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:54:14,831 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:54:14,831 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:54:14,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:54:14,833 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:54:14,833 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:54:14,833 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:54:14,834 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:54:14,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:54:14,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:54:14,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:54:14,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:54:14,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:54:14,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:54:14,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:54:14,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:54:14,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:54:14,837 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:54:14,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:54:14,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:54:14,837 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:54:14,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:54:14,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:54:14,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:54:14,936 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:54:14,936 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:54:14,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-programs/copysome1_true-unreach-call.i [2018-11-14 18:54:14,999 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1a96a8d/cb2bd3ee48d64076b63f46e282264e8f/FLAGed8f2a22f [2018-11-14 18:54:15,440 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:54:15,440 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-programs/copysome1_true-unreach-call.i [2018-11-14 18:54:15,447 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1a96a8d/cb2bd3ee48d64076b63f46e282264e8f/FLAGed8f2a22f [2018-11-14 18:54:15,464 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1a96a8d/cb2bd3ee48d64076b63f46e282264e8f [2018-11-14 18:54:15,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:54:15,477 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:54:15,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:54:15,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:54:15,483 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:54:15,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:54:15" (1/1) ... [2018-11-14 18:54:15,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36543a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:15, skipping insertion in model container [2018-11-14 18:54:15,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:54:15" (1/1) ... [2018-11-14 18:54:15,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:54:15,530 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:54:15,757 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:54:15,761 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:54:15,785 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:54:15,806 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:54:15,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:15 WrapperNode [2018-11-14 18:54:15,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:54:15,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:54:15,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:54:15,808 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:54:15,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:15" (1/1) ... [2018-11-14 18:54:15,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:15" (1/1) ... [2018-11-14 18:54:15,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:15" (1/1) ... [2018-11-14 18:54:15,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:15" (1/1) ... [2018-11-14 18:54:15,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:15" (1/1) ... [2018-11-14 18:54:15,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:15" (1/1) ... [2018-11-14 18:54:15,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:15" (1/1) ... [2018-11-14 18:54:15,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:54:15,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:54:15,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:54:15,852 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:54:15,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:54:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:54:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:54:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:54:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:54:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:54:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:54:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:54:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:54:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:54:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:54:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:54:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:54:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:54:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:54:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:54:16,578 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:54:16,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:54:16 BoogieIcfgContainer [2018-11-14 18:54:16,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:54:16,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:54:16,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:54:16,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:54:16,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:54:15" (1/3) ... [2018-11-14 18:54:16,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac6a935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:54:16, skipping insertion in model container [2018-11-14 18:54:16,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:15" (2/3) ... [2018-11-14 18:54:16,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac6a935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:54:16, skipping insertion in model container [2018-11-14 18:54:16,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:54:16" (3/3) ... [2018-11-14 18:54:16,588 INFO L112 eAbstractionObserver]: Analyzing ICFG copysome1_true-unreach-call.i [2018-11-14 18:54:16,597 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:54:16,604 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:54:16,618 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:54:16,649 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:54:16,650 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:54:16,650 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:54:16,650 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:54:16,650 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:54:16,650 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:54:16,650 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:54:16,651 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:54:16,651 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:54:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-14 18:54:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 18:54:16,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:16,679 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:16,681 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:16,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash -347827131, now seen corresponding path program 1 times [2018-11-14 18:54:16,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:16,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:16,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:16,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-14 18:54:16,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-14 18:54:16,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-14 18:54:16,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #76#return; {35#true} is VALID [2018-11-14 18:54:16,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2018-11-14 18:54:16,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {35#true} is VALID [2018-11-14 18:54:16,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-14 18:54:16,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-14 18:54:16,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-14 18:54:16,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} havoc ~x~0;~x~0 := 0; {36#false} is VALID [2018-11-14 18:54:16,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-14 18:54:16,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !!(~x~0 < 200000); {36#false} is VALID [2018-11-14 18:54:16,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {36#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {36#false} is VALID [2018-11-14 18:54:16,864 INFO L256 TraceCheckUtils]: 13: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {36#false} is VALID [2018-11-14 18:54:16,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-14 18:54:16,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume ~cond == 0; {36#false} is VALID [2018-11-14 18:54:16,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-14 18:54:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:54:16,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:54:16,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:54:16,877 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-14 18:54:16,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:16,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:54:17,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:17,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:54:17,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:54:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:54:17,057 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-14 18:54:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:17,246 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-14 18:54:17,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:54:17,247 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-14 18:54:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:54:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-14 18:54:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:54:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-14 18:54:17,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2018-11-14 18:54:17,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:17,634 INFO L225 Difference]: With dead ends: 55 [2018-11-14 18:54:17,634 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 18:54:17,638 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:54:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 18:54:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 18:54:17,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:17,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 18:54:17,792 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 18:54:17,792 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 18:54:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:17,797 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 18:54:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 18:54:17,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:17,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:17,798 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 18:54:17,799 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 18:54:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:17,803 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 18:54:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 18:54:17,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:17,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:17,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:17,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:54:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-14 18:54:17,810 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2018-11-14 18:54:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:17,811 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-14 18:54:17,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:54:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 18:54:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:54:17,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:17,812 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:17,812 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:17,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:17,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1965010549, now seen corresponding path program 1 times [2018-11-14 18:54:17,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:17,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:17,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:17,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:17,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:17,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {197#true} is VALID [2018-11-14 18:54:17,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {197#true} is VALID [2018-11-14 18:54:17,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {197#true} assume true; {197#true} is VALID [2018-11-14 18:54:17,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} #76#return; {197#true} is VALID [2018-11-14 18:54:17,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {197#true} call #t~ret8 := main(); {197#true} is VALID [2018-11-14 18:54:17,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {197#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {199#(= main_~i~0 0)} is VALID [2018-11-14 18:54:17,982 INFO L273 TraceCheckUtils]: 6: Hoare triple {199#(= main_~i~0 0)} assume true; {199#(= main_~i~0 0)} is VALID [2018-11-14 18:54:17,983 INFO L273 TraceCheckUtils]: 7: Hoare triple {199#(= main_~i~0 0)} assume !(~i~0 < 200000); {198#false} is VALID [2018-11-14 18:54:17,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#false} ~i~0 := 0; {198#false} is VALID [2018-11-14 18:54:17,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#false} assume true; {198#false} is VALID [2018-11-14 18:54:17,984 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#false} assume !(~i~0 < 200000); {198#false} is VALID [2018-11-14 18:54:17,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#false} havoc ~x~0;~x~0 := 0; {198#false} is VALID [2018-11-14 18:54:17,984 INFO L273 TraceCheckUtils]: 12: Hoare triple {198#false} assume true; {198#false} is VALID [2018-11-14 18:54:17,985 INFO L273 TraceCheckUtils]: 13: Hoare triple {198#false} assume !!(~x~0 < 200000); {198#false} is VALID [2018-11-14 18:54:17,985 INFO L273 TraceCheckUtils]: 14: Hoare triple {198#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {198#false} is VALID [2018-11-14 18:54:17,985 INFO L256 TraceCheckUtils]: 15: Hoare triple {198#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {198#false} is VALID [2018-11-14 18:54:17,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#false} ~cond := #in~cond; {198#false} is VALID [2018-11-14 18:54:17,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#false} assume ~cond == 0; {198#false} is VALID [2018-11-14 18:54:17,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#false} assume !false; {198#false} is VALID [2018-11-14 18:54:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:54:17,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:54:17,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:54:17,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:54:17,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:17,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:54:18,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:18,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:54:18,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:54:18,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:54:18,055 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2018-11-14 18:54:18,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:18,487 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-14 18:54:18,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:54:18,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:54:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:54:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 18:54:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:54:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 18:54:18,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-14 18:54:18,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:18,679 INFO L225 Difference]: With dead ends: 52 [2018-11-14 18:54:18,679 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:54:18,681 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:54:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:54:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-14 18:54:18,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:18,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 31 states. [2018-11-14 18:54:18,724 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 31 states. [2018-11-14 18:54:18,724 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 31 states. [2018-11-14 18:54:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:18,727 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-14 18:54:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-14 18:54:18,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:18,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:18,728 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 34 states. [2018-11-14 18:54:18,728 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 34 states. [2018-11-14 18:54:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:18,731 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-14 18:54:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-14 18:54:18,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:18,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:18,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:18,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:54:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 18:54:18,735 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2018-11-14 18:54:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:18,736 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 18:54:18,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:54:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 18:54:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:54:18,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:18,737 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:18,738 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:18,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:18,738 INFO L82 PathProgramCache]: Analyzing trace with hash -495190299, now seen corresponding path program 1 times [2018-11-14 18:54:18,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:18,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:18,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:18,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {379#true} is VALID [2018-11-14 18:54:18,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {379#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {379#true} is VALID [2018-11-14 18:54:18,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2018-11-14 18:54:18,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #76#return; {379#true} is VALID [2018-11-14 18:54:18,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret8 := main(); {379#true} is VALID [2018-11-14 18:54:18,874 INFO L273 TraceCheckUtils]: 5: Hoare triple {379#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {381#(= main_~i~0 0)} is VALID [2018-11-14 18:54:18,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {381#(= main_~i~0 0)} assume true; {381#(= main_~i~0 0)} is VALID [2018-11-14 18:54:18,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {381#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {381#(= main_~i~0 0)} is VALID [2018-11-14 18:54:18,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {381#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {382#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:18,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {382#(<= main_~i~0 1)} assume true; {382#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:18,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {382#(<= main_~i~0 1)} assume !(~i~0 < 200000); {380#false} is VALID [2018-11-14 18:54:18,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {380#false} ~i~0 := 0; {380#false} is VALID [2018-11-14 18:54:18,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {380#false} assume true; {380#false} is VALID [2018-11-14 18:54:18,881 INFO L273 TraceCheckUtils]: 13: Hoare triple {380#false} assume !!(~i~0 < 200000); {380#false} is VALID [2018-11-14 18:54:18,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {380#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {380#false} is VALID [2018-11-14 18:54:18,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {380#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {380#false} is VALID [2018-11-14 18:54:18,882 INFO L273 TraceCheckUtils]: 16: Hoare triple {380#false} assume true; {380#false} is VALID [2018-11-14 18:54:18,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {380#false} assume !(~i~0 < 200000); {380#false} is VALID [2018-11-14 18:54:18,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {380#false} havoc ~x~0;~x~0 := 0; {380#false} is VALID [2018-11-14 18:54:18,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {380#false} assume true; {380#false} is VALID [2018-11-14 18:54:18,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {380#false} assume !!(~x~0 < 200000); {380#false} is VALID [2018-11-14 18:54:18,884 INFO L273 TraceCheckUtils]: 21: Hoare triple {380#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {380#false} is VALID [2018-11-14 18:54:18,884 INFO L256 TraceCheckUtils]: 22: Hoare triple {380#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {380#false} is VALID [2018-11-14 18:54:18,885 INFO L273 TraceCheckUtils]: 23: Hoare triple {380#false} ~cond := #in~cond; {380#false} is VALID [2018-11-14 18:54:18,885 INFO L273 TraceCheckUtils]: 24: Hoare triple {380#false} assume ~cond == 0; {380#false} is VALID [2018-11-14 18:54:18,885 INFO L273 TraceCheckUtils]: 25: Hoare triple {380#false} assume !false; {380#false} is VALID [2018-11-14 18:54:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:54:18,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:18,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:18,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:18,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:19,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {379#true} is VALID [2018-11-14 18:54:19,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {379#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {379#true} is VALID [2018-11-14 18:54:19,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2018-11-14 18:54:19,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #76#return; {379#true} is VALID [2018-11-14 18:54:19,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret8 := main(); {379#true} is VALID [2018-11-14 18:54:19,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {379#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {401#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:19,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {401#(<= main_~i~0 0)} assume true; {401#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:19,420 INFO L273 TraceCheckUtils]: 7: Hoare triple {401#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {401#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:19,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {401#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {382#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:19,422 INFO L273 TraceCheckUtils]: 9: Hoare triple {382#(<= main_~i~0 1)} assume true; {382#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:19,422 INFO L273 TraceCheckUtils]: 10: Hoare triple {382#(<= main_~i~0 1)} assume !(~i~0 < 200000); {380#false} is VALID [2018-11-14 18:54:19,423 INFO L273 TraceCheckUtils]: 11: Hoare triple {380#false} ~i~0 := 0; {380#false} is VALID [2018-11-14 18:54:19,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {380#false} assume true; {380#false} is VALID [2018-11-14 18:54:19,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {380#false} assume !!(~i~0 < 200000); {380#false} is VALID [2018-11-14 18:54:19,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {380#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {380#false} is VALID [2018-11-14 18:54:19,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {380#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {380#false} is VALID [2018-11-14 18:54:19,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {380#false} assume true; {380#false} is VALID [2018-11-14 18:54:19,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {380#false} assume !(~i~0 < 200000); {380#false} is VALID [2018-11-14 18:54:19,426 INFO L273 TraceCheckUtils]: 18: Hoare triple {380#false} havoc ~x~0;~x~0 := 0; {380#false} is VALID [2018-11-14 18:54:19,426 INFO L273 TraceCheckUtils]: 19: Hoare triple {380#false} assume true; {380#false} is VALID [2018-11-14 18:54:19,427 INFO L273 TraceCheckUtils]: 20: Hoare triple {380#false} assume !!(~x~0 < 200000); {380#false} is VALID [2018-11-14 18:54:19,427 INFO L273 TraceCheckUtils]: 21: Hoare triple {380#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {380#false} is VALID [2018-11-14 18:54:19,427 INFO L256 TraceCheckUtils]: 22: Hoare triple {380#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {380#false} is VALID [2018-11-14 18:54:19,428 INFO L273 TraceCheckUtils]: 23: Hoare triple {380#false} ~cond := #in~cond; {380#false} is VALID [2018-11-14 18:54:19,428 INFO L273 TraceCheckUtils]: 24: Hoare triple {380#false} assume ~cond == 0; {380#false} is VALID [2018-11-14 18:54:19,428 INFO L273 TraceCheckUtils]: 25: Hoare triple {380#false} assume !false; {380#false} is VALID [2018-11-14 18:54:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:54:19,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:19,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:54:19,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 18:54:19,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:19,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:54:19,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:19,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:54:19,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:54:19,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:54:19,527 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2018-11-14 18:54:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:19,925 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-14 18:54:19,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:54:19,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 18:54:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:54:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-14 18:54:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:54:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-14 18:54:19,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-14 18:54:20,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:20,114 INFO L225 Difference]: With dead ends: 61 [2018-11-14 18:54:20,114 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 18:54:20,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:54:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 18:54:20,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-11-14 18:54:20,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:20,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2018-11-14 18:54:20,139 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2018-11-14 18:54:20,139 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2018-11-14 18:54:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:20,142 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-14 18:54:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-14 18:54:20,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:20,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:20,144 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2018-11-14 18:54:20,144 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2018-11-14 18:54:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:20,147 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-14 18:54:20,148 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-14 18:54:20,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:20,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:20,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:20,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:54:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-14 18:54:20,153 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 26 [2018-11-14 18:54:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:20,154 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-14 18:54:20,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:54:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-14 18:54:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 18:54:20,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:20,155 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:20,156 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:20,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:20,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1212211623, now seen corresponding path program 2 times [2018-11-14 18:54:20,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:20,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:20,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:20,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:20,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:20,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {673#true} call ULTIMATE.init(); {673#true} is VALID [2018-11-14 18:54:20,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {673#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {673#true} is VALID [2018-11-14 18:54:20,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {673#true} assume true; {673#true} is VALID [2018-11-14 18:54:20,307 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {673#true} {673#true} #76#return; {673#true} is VALID [2018-11-14 18:54:20,307 INFO L256 TraceCheckUtils]: 4: Hoare triple {673#true} call #t~ret8 := main(); {673#true} is VALID [2018-11-14 18:54:20,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {673#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {675#(= main_~i~0 0)} is VALID [2018-11-14 18:54:20,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {675#(= main_~i~0 0)} assume true; {675#(= main_~i~0 0)} is VALID [2018-11-14 18:54:20,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {675#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {675#(= main_~i~0 0)} is VALID [2018-11-14 18:54:20,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {675#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {676#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:20,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {676#(<= main_~i~0 1)} assume true; {676#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:20,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {676#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {676#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:20,316 INFO L273 TraceCheckUtils]: 11: Hoare triple {676#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {677#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:20,317 INFO L273 TraceCheckUtils]: 12: Hoare triple {677#(<= main_~i~0 2)} assume true; {677#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:20,318 INFO L273 TraceCheckUtils]: 13: Hoare triple {677#(<= main_~i~0 2)} assume !(~i~0 < 200000); {674#false} is VALID [2018-11-14 18:54:20,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {674#false} ~i~0 := 0; {674#false} is VALID [2018-11-14 18:54:20,318 INFO L273 TraceCheckUtils]: 15: Hoare triple {674#false} assume true; {674#false} is VALID [2018-11-14 18:54:20,318 INFO L273 TraceCheckUtils]: 16: Hoare triple {674#false} assume !!(~i~0 < 200000); {674#false} is VALID [2018-11-14 18:54:20,319 INFO L273 TraceCheckUtils]: 17: Hoare triple {674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {674#false} is VALID [2018-11-14 18:54:20,319 INFO L273 TraceCheckUtils]: 18: Hoare triple {674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {674#false} is VALID [2018-11-14 18:54:20,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {674#false} assume true; {674#false} is VALID [2018-11-14 18:54:20,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {674#false} assume !!(~i~0 < 200000); {674#false} is VALID [2018-11-14 18:54:20,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {674#false} is VALID [2018-11-14 18:54:20,320 INFO L273 TraceCheckUtils]: 22: Hoare triple {674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {674#false} is VALID [2018-11-14 18:54:20,320 INFO L273 TraceCheckUtils]: 23: Hoare triple {674#false} assume true; {674#false} is VALID [2018-11-14 18:54:20,321 INFO L273 TraceCheckUtils]: 24: Hoare triple {674#false} assume !(~i~0 < 200000); {674#false} is VALID [2018-11-14 18:54:20,321 INFO L273 TraceCheckUtils]: 25: Hoare triple {674#false} havoc ~x~0;~x~0 := 0; {674#false} is VALID [2018-11-14 18:54:20,321 INFO L273 TraceCheckUtils]: 26: Hoare triple {674#false} assume true; {674#false} is VALID [2018-11-14 18:54:20,322 INFO L273 TraceCheckUtils]: 27: Hoare triple {674#false} assume !!(~x~0 < 200000); {674#false} is VALID [2018-11-14 18:54:20,322 INFO L273 TraceCheckUtils]: 28: Hoare triple {674#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {674#false} is VALID [2018-11-14 18:54:20,322 INFO L256 TraceCheckUtils]: 29: Hoare triple {674#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {674#false} is VALID [2018-11-14 18:54:20,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {674#false} ~cond := #in~cond; {674#false} is VALID [2018-11-14 18:54:20,323 INFO L273 TraceCheckUtils]: 31: Hoare triple {674#false} assume ~cond == 0; {674#false} is VALID [2018-11-14 18:54:20,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {674#false} assume !false; {674#false} is VALID [2018-11-14 18:54:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 18:54:20,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:20,326 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:20,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:54:20,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:54:20,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:20,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:20,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {673#true} call ULTIMATE.init(); {673#true} is VALID [2018-11-14 18:54:20,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {673#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {673#true} is VALID [2018-11-14 18:54:20,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {673#true} assume true; {673#true} is VALID [2018-11-14 18:54:20,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {673#true} {673#true} #76#return; {673#true} is VALID [2018-11-14 18:54:20,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {673#true} call #t~ret8 := main(); {673#true} is VALID [2018-11-14 18:54:20,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {673#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {696#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:20,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {696#(<= main_~i~0 0)} assume true; {696#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:20,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {696#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {696#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:20,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {696#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {676#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:20,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {676#(<= main_~i~0 1)} assume true; {676#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:20,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {676#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {676#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:20,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {676#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {677#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:20,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {677#(<= main_~i~0 2)} assume true; {677#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:20,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {677#(<= main_~i~0 2)} assume !(~i~0 < 200000); {674#false} is VALID [2018-11-14 18:54:20,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {674#false} ~i~0 := 0; {674#false} is VALID [2018-11-14 18:54:20,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {674#false} assume true; {674#false} is VALID [2018-11-14 18:54:20,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {674#false} assume !!(~i~0 < 200000); {674#false} is VALID [2018-11-14 18:54:20,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {674#false} is VALID [2018-11-14 18:54:20,550 INFO L273 TraceCheckUtils]: 18: Hoare triple {674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {674#false} is VALID [2018-11-14 18:54:20,551 INFO L273 TraceCheckUtils]: 19: Hoare triple {674#false} assume true; {674#false} is VALID [2018-11-14 18:54:20,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {674#false} assume !!(~i~0 < 200000); {674#false} is VALID [2018-11-14 18:54:20,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {674#false} is VALID [2018-11-14 18:54:20,552 INFO L273 TraceCheckUtils]: 22: Hoare triple {674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {674#false} is VALID [2018-11-14 18:54:20,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {674#false} assume true; {674#false} is VALID [2018-11-14 18:54:20,552 INFO L273 TraceCheckUtils]: 24: Hoare triple {674#false} assume !(~i~0 < 200000); {674#false} is VALID [2018-11-14 18:54:20,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {674#false} havoc ~x~0;~x~0 := 0; {674#false} is VALID [2018-11-14 18:54:20,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {674#false} assume true; {674#false} is VALID [2018-11-14 18:54:20,553 INFO L273 TraceCheckUtils]: 27: Hoare triple {674#false} assume !!(~x~0 < 200000); {674#false} is VALID [2018-11-14 18:54:20,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {674#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {674#false} is VALID [2018-11-14 18:54:20,554 INFO L256 TraceCheckUtils]: 29: Hoare triple {674#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {674#false} is VALID [2018-11-14 18:54:20,554 INFO L273 TraceCheckUtils]: 30: Hoare triple {674#false} ~cond := #in~cond; {674#false} is VALID [2018-11-14 18:54:20,554 INFO L273 TraceCheckUtils]: 31: Hoare triple {674#false} assume ~cond == 0; {674#false} is VALID [2018-11-14 18:54:20,555 INFO L273 TraceCheckUtils]: 32: Hoare triple {674#false} assume !false; {674#false} is VALID [2018-11-14 18:54:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 18:54:20,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:20,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 18:54:20,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-14 18:54:20,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:20,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:54:20,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:20,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:54:20,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:54:20,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:54:20,615 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 6 states. [2018-11-14 18:54:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:20,843 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-11-14 18:54:20,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:54:20,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-14 18:54:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:54:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2018-11-14 18:54:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:54:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2018-11-14 18:54:20,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2018-11-14 18:54:20,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:20,972 INFO L225 Difference]: With dead ends: 72 [2018-11-14 18:54:20,972 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 18:54:20,973 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:54:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 18:54:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-11-14 18:54:21,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:21,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 45 states. [2018-11-14 18:54:21,014 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 45 states. [2018-11-14 18:54:21,014 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 45 states. [2018-11-14 18:54:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:21,016 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-14 18:54:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-14 18:54:21,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:21,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:21,018 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 48 states. [2018-11-14 18:54:21,018 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 48 states. [2018-11-14 18:54:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:21,021 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-14 18:54:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-14 18:54:21,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:21,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:21,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:21,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 18:54:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-14 18:54:21,025 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 33 [2018-11-14 18:54:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:21,025 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-14 18:54:21,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:54:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-14 18:54:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 18:54:21,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:21,027 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:21,028 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:21,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:21,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1125816105, now seen corresponding path program 3 times [2018-11-14 18:54:21,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:21,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:21,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:21,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:21,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:21,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1026#true} is VALID [2018-11-14 18:54:21,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {1026#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1026#true} is VALID [2018-11-14 18:54:21,210 INFO L273 TraceCheckUtils]: 2: Hoare triple {1026#true} assume true; {1026#true} is VALID [2018-11-14 18:54:21,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1026#true} {1026#true} #76#return; {1026#true} is VALID [2018-11-14 18:54:21,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {1026#true} call #t~ret8 := main(); {1026#true} is VALID [2018-11-14 18:54:21,211 INFO L273 TraceCheckUtils]: 5: Hoare triple {1026#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1028#(= main_~i~0 0)} is VALID [2018-11-14 18:54:21,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {1028#(= main_~i~0 0)} assume true; {1028#(= main_~i~0 0)} is VALID [2018-11-14 18:54:21,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {1028#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1028#(= main_~i~0 0)} is VALID [2018-11-14 18:54:21,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {1028#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1029#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:21,214 INFO L273 TraceCheckUtils]: 9: Hoare triple {1029#(<= main_~i~0 1)} assume true; {1029#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:21,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {1029#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1029#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:21,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {1029#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1030#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:21,216 INFO L273 TraceCheckUtils]: 12: Hoare triple {1030#(<= main_~i~0 2)} assume true; {1030#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:21,216 INFO L273 TraceCheckUtils]: 13: Hoare triple {1030#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1030#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:21,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {1030#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1031#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:21,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {1031#(<= main_~i~0 3)} assume true; {1031#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:21,219 INFO L273 TraceCheckUtils]: 16: Hoare triple {1031#(<= main_~i~0 3)} assume !(~i~0 < 200000); {1027#false} is VALID [2018-11-14 18:54:21,219 INFO L273 TraceCheckUtils]: 17: Hoare triple {1027#false} ~i~0 := 0; {1027#false} is VALID [2018-11-14 18:54:21,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {1027#false} assume true; {1027#false} is VALID [2018-11-14 18:54:21,220 INFO L273 TraceCheckUtils]: 19: Hoare triple {1027#false} assume !!(~i~0 < 200000); {1027#false} is VALID [2018-11-14 18:54:21,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {1027#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1027#false} is VALID [2018-11-14 18:54:21,220 INFO L273 TraceCheckUtils]: 21: Hoare triple {1027#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1027#false} is VALID [2018-11-14 18:54:21,221 INFO L273 TraceCheckUtils]: 22: Hoare triple {1027#false} assume true; {1027#false} is VALID [2018-11-14 18:54:21,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {1027#false} assume !!(~i~0 < 200000); {1027#false} is VALID [2018-11-14 18:54:21,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {1027#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1027#false} is VALID [2018-11-14 18:54:21,222 INFO L273 TraceCheckUtils]: 25: Hoare triple {1027#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1027#false} is VALID [2018-11-14 18:54:21,222 INFO L273 TraceCheckUtils]: 26: Hoare triple {1027#false} assume true; {1027#false} is VALID [2018-11-14 18:54:21,223 INFO L273 TraceCheckUtils]: 27: Hoare triple {1027#false} assume !!(~i~0 < 200000); {1027#false} is VALID [2018-11-14 18:54:21,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {1027#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1027#false} is VALID [2018-11-14 18:54:21,223 INFO L273 TraceCheckUtils]: 29: Hoare triple {1027#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1027#false} is VALID [2018-11-14 18:54:21,223 INFO L273 TraceCheckUtils]: 30: Hoare triple {1027#false} assume true; {1027#false} is VALID [2018-11-14 18:54:21,223 INFO L273 TraceCheckUtils]: 31: Hoare triple {1027#false} assume !(~i~0 < 200000); {1027#false} is VALID [2018-11-14 18:54:21,224 INFO L273 TraceCheckUtils]: 32: Hoare triple {1027#false} havoc ~x~0;~x~0 := 0; {1027#false} is VALID [2018-11-14 18:54:21,224 INFO L273 TraceCheckUtils]: 33: Hoare triple {1027#false} assume true; {1027#false} is VALID [2018-11-14 18:54:21,224 INFO L273 TraceCheckUtils]: 34: Hoare triple {1027#false} assume !!(~x~0 < 200000); {1027#false} is VALID [2018-11-14 18:54:21,224 INFO L273 TraceCheckUtils]: 35: Hoare triple {1027#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {1027#false} is VALID [2018-11-14 18:54:21,224 INFO L256 TraceCheckUtils]: 36: Hoare triple {1027#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1027#false} is VALID [2018-11-14 18:54:21,225 INFO L273 TraceCheckUtils]: 37: Hoare triple {1027#false} ~cond := #in~cond; {1027#false} is VALID [2018-11-14 18:54:21,225 INFO L273 TraceCheckUtils]: 38: Hoare triple {1027#false} assume ~cond == 0; {1027#false} is VALID [2018-11-14 18:54:21,225 INFO L273 TraceCheckUtils]: 39: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2018-11-14 18:54:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 18:54:21,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:21,229 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:21,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:54:21,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 18:54:21,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:21,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:21,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1026#true} is VALID [2018-11-14 18:54:21,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {1026#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1026#true} is VALID [2018-11-14 18:54:21,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {1026#true} assume true; {1026#true} is VALID [2018-11-14 18:54:21,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1026#true} {1026#true} #76#return; {1026#true} is VALID [2018-11-14 18:54:21,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {1026#true} call #t~ret8 := main(); {1026#true} is VALID [2018-11-14 18:54:21,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {1026#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1026#true} is VALID [2018-11-14 18:54:21,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {1026#true} assume true; {1026#true} is VALID [2018-11-14 18:54:21,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {1026#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1026#true} is VALID [2018-11-14 18:54:21,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {1026#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1026#true} is VALID [2018-11-14 18:54:21,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {1026#true} assume true; {1026#true} is VALID [2018-11-14 18:54:21,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {1026#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1026#true} is VALID [2018-11-14 18:54:21,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {1026#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1026#true} is VALID [2018-11-14 18:54:21,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {1026#true} assume true; {1026#true} is VALID [2018-11-14 18:54:21,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {1026#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1074#(< main_~i~0 200000)} is VALID [2018-11-14 18:54:21,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {1074#(< main_~i~0 200000)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1078#(<= main_~i~0 200000)} is VALID [2018-11-14 18:54:21,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {1078#(<= main_~i~0 200000)} assume true; {1078#(<= main_~i~0 200000)} is VALID [2018-11-14 18:54:21,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {1078#(<= main_~i~0 200000)} assume !(~i~0 < 200000); {1026#true} is VALID [2018-11-14 18:54:21,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {1026#true} ~i~0 := 0; {1088#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:21,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {1088#(<= main_~i~0 0)} assume true; {1088#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:21,508 INFO L273 TraceCheckUtils]: 19: Hoare triple {1088#(<= main_~i~0 0)} assume !!(~i~0 < 200000); {1088#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:21,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {1088#(<= main_~i~0 0)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1088#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:21,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {1088#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1029#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:21,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {1029#(<= main_~i~0 1)} assume true; {1029#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:21,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {1029#(<= main_~i~0 1)} assume !!(~i~0 < 200000); {1029#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:21,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {1029#(<= main_~i~0 1)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1029#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:21,513 INFO L273 TraceCheckUtils]: 25: Hoare triple {1029#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1030#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:21,513 INFO L273 TraceCheckUtils]: 26: Hoare triple {1030#(<= main_~i~0 2)} assume true; {1030#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:21,514 INFO L273 TraceCheckUtils]: 27: Hoare triple {1030#(<= main_~i~0 2)} assume !!(~i~0 < 200000); {1030#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:21,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {1030#(<= main_~i~0 2)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1030#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:21,516 INFO L273 TraceCheckUtils]: 29: Hoare triple {1030#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1031#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:21,517 INFO L273 TraceCheckUtils]: 30: Hoare triple {1031#(<= main_~i~0 3)} assume true; {1031#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:21,518 INFO L273 TraceCheckUtils]: 31: Hoare triple {1031#(<= main_~i~0 3)} assume !(~i~0 < 200000); {1027#false} is VALID [2018-11-14 18:54:21,519 INFO L273 TraceCheckUtils]: 32: Hoare triple {1027#false} havoc ~x~0;~x~0 := 0; {1027#false} is VALID [2018-11-14 18:54:21,519 INFO L273 TraceCheckUtils]: 33: Hoare triple {1027#false} assume true; {1027#false} is VALID [2018-11-14 18:54:21,519 INFO L273 TraceCheckUtils]: 34: Hoare triple {1027#false} assume !!(~x~0 < 200000); {1027#false} is VALID [2018-11-14 18:54:21,520 INFO L273 TraceCheckUtils]: 35: Hoare triple {1027#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {1027#false} is VALID [2018-11-14 18:54:21,520 INFO L256 TraceCheckUtils]: 36: Hoare triple {1027#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1027#false} is VALID [2018-11-14 18:54:21,520 INFO L273 TraceCheckUtils]: 37: Hoare triple {1027#false} ~cond := #in~cond; {1027#false} is VALID [2018-11-14 18:54:21,521 INFO L273 TraceCheckUtils]: 38: Hoare triple {1027#false} assume ~cond == 0; {1027#false} is VALID [2018-11-14 18:54:21,521 INFO L273 TraceCheckUtils]: 39: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2018-11-14 18:54:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 18:54:21,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:21,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-11-14 18:54:21,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-14 18:54:21,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:21,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:54:21,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:21,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:54:21,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:54:21,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:54:21,617 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 9 states. [2018-11-14 18:54:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:21,889 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2018-11-14 18:54:21,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:54:21,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-14 18:54:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:54:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2018-11-14 18:54:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:54:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2018-11-14 18:54:21,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2018-11-14 18:54:22,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:22,059 INFO L225 Difference]: With dead ends: 87 [2018-11-14 18:54:22,059 INFO L226 Difference]: Without dead ends: 59 [2018-11-14 18:54:22,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 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-14 18:54:22,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-14 18:54:22,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-14 18:54:22,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:22,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-14 18:54:22,083 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-14 18:54:22,083 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-14 18:54:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:22,086 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-14 18:54:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-14 18:54:22,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:22,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:22,088 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-14 18:54:22,088 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-14 18:54:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:22,091 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-14 18:54:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-14 18:54:22,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:22,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:22,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:22,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 18:54:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-11-14 18:54:22,095 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 40 [2018-11-14 18:54:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:22,095 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-14 18:54:22,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:54:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-14 18:54:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 18:54:22,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:22,097 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:22,098 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:22,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash -975775543, now seen corresponding path program 4 times [2018-11-14 18:54:22,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:22,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:22,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:22,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:22,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:22,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {1463#true} call ULTIMATE.init(); {1463#true} is VALID [2018-11-14 18:54:22,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {1463#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1463#true} is VALID [2018-11-14 18:54:22,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {1463#true} assume true; {1463#true} is VALID [2018-11-14 18:54:22,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1463#true} {1463#true} #76#return; {1463#true} is VALID [2018-11-14 18:54:22,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {1463#true} call #t~ret8 := main(); {1463#true} is VALID [2018-11-14 18:54:22,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {1463#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1465#(= main_~i~0 0)} is VALID [2018-11-14 18:54:22,297 INFO L273 TraceCheckUtils]: 6: Hoare triple {1465#(= main_~i~0 0)} assume true; {1465#(= main_~i~0 0)} is VALID [2018-11-14 18:54:22,298 INFO L273 TraceCheckUtils]: 7: Hoare triple {1465#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1465#(= main_~i~0 0)} is VALID [2018-11-14 18:54:22,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {1465#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1466#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:22,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {1466#(<= main_~i~0 1)} assume true; {1466#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:22,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {1466#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1466#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:22,300 INFO L273 TraceCheckUtils]: 11: Hoare triple {1466#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1467#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:22,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {1467#(<= main_~i~0 2)} assume true; {1467#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:22,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {1467#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1467#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:22,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {1467#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1468#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:22,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {1468#(<= main_~i~0 3)} assume true; {1468#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:22,304 INFO L273 TraceCheckUtils]: 16: Hoare triple {1468#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1468#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:22,305 INFO L273 TraceCheckUtils]: 17: Hoare triple {1468#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1469#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:22,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {1469#(<= main_~i~0 4)} assume true; {1469#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:22,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {1469#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1469#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:22,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {1469#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1470#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:22,319 INFO L273 TraceCheckUtils]: 21: Hoare triple {1470#(<= main_~i~0 5)} assume true; {1470#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:22,321 INFO L273 TraceCheckUtils]: 22: Hoare triple {1470#(<= main_~i~0 5)} assume !(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,321 INFO L273 TraceCheckUtils]: 23: Hoare triple {1464#false} ~i~0 := 0; {1464#false} is VALID [2018-11-14 18:54:22,322 INFO L273 TraceCheckUtils]: 24: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,322 INFO L273 TraceCheckUtils]: 25: Hoare triple {1464#false} assume !!(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,322 INFO L273 TraceCheckUtils]: 26: Hoare triple {1464#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1464#false} is VALID [2018-11-14 18:54:22,322 INFO L273 TraceCheckUtils]: 27: Hoare triple {1464#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1464#false} is VALID [2018-11-14 18:54:22,322 INFO L273 TraceCheckUtils]: 28: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,323 INFO L273 TraceCheckUtils]: 29: Hoare triple {1464#false} assume !!(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,323 INFO L273 TraceCheckUtils]: 30: Hoare triple {1464#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1464#false} is VALID [2018-11-14 18:54:22,323 INFO L273 TraceCheckUtils]: 31: Hoare triple {1464#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1464#false} is VALID [2018-11-14 18:54:22,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,323 INFO L273 TraceCheckUtils]: 33: Hoare triple {1464#false} assume !!(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {1464#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1464#false} is VALID [2018-11-14 18:54:22,324 INFO L273 TraceCheckUtils]: 35: Hoare triple {1464#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1464#false} is VALID [2018-11-14 18:54:22,324 INFO L273 TraceCheckUtils]: 36: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,324 INFO L273 TraceCheckUtils]: 37: Hoare triple {1464#false} assume !!(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,324 INFO L273 TraceCheckUtils]: 38: Hoare triple {1464#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1464#false} is VALID [2018-11-14 18:54:22,325 INFO L273 TraceCheckUtils]: 39: Hoare triple {1464#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1464#false} is VALID [2018-11-14 18:54:22,325 INFO L273 TraceCheckUtils]: 40: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,325 INFO L273 TraceCheckUtils]: 41: Hoare triple {1464#false} assume !!(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,325 INFO L273 TraceCheckUtils]: 42: Hoare triple {1464#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1464#false} is VALID [2018-11-14 18:54:22,325 INFO L273 TraceCheckUtils]: 43: Hoare triple {1464#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1464#false} is VALID [2018-11-14 18:54:22,326 INFO L273 TraceCheckUtils]: 44: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,326 INFO L273 TraceCheckUtils]: 45: Hoare triple {1464#false} assume !(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,326 INFO L273 TraceCheckUtils]: 46: Hoare triple {1464#false} havoc ~x~0;~x~0 := 0; {1464#false} is VALID [2018-11-14 18:54:22,326 INFO L273 TraceCheckUtils]: 47: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,326 INFO L273 TraceCheckUtils]: 48: Hoare triple {1464#false} assume !!(~x~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,326 INFO L273 TraceCheckUtils]: 49: Hoare triple {1464#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {1464#false} is VALID [2018-11-14 18:54:22,327 INFO L256 TraceCheckUtils]: 50: Hoare triple {1464#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1464#false} is VALID [2018-11-14 18:54:22,327 INFO L273 TraceCheckUtils]: 51: Hoare triple {1464#false} ~cond := #in~cond; {1464#false} is VALID [2018-11-14 18:54:22,327 INFO L273 TraceCheckUtils]: 52: Hoare triple {1464#false} assume ~cond == 0; {1464#false} is VALID [2018-11-14 18:54:22,327 INFO L273 TraceCheckUtils]: 53: Hoare triple {1464#false} assume !false; {1464#false} is VALID [2018-11-14 18:54:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-14 18:54:22,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:22,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:22,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:54:22,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:54:22,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:22,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:22,576 INFO L256 TraceCheckUtils]: 0: Hoare triple {1463#true} call ULTIMATE.init(); {1463#true} is VALID [2018-11-14 18:54:22,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {1463#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1463#true} is VALID [2018-11-14 18:54:22,577 INFO L273 TraceCheckUtils]: 2: Hoare triple {1463#true} assume true; {1463#true} is VALID [2018-11-14 18:54:22,577 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1463#true} {1463#true} #76#return; {1463#true} is VALID [2018-11-14 18:54:22,578 INFO L256 TraceCheckUtils]: 4: Hoare triple {1463#true} call #t~ret8 := main(); {1463#true} is VALID [2018-11-14 18:54:22,579 INFO L273 TraceCheckUtils]: 5: Hoare triple {1463#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1489#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:22,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {1489#(<= main_~i~0 0)} assume true; {1489#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:22,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {1489#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1489#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:22,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {1489#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1466#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:22,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {1466#(<= main_~i~0 1)} assume true; {1466#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:22,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {1466#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1466#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:22,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {1466#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1467#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:22,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {1467#(<= main_~i~0 2)} assume true; {1467#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:22,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {1467#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1467#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:22,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {1467#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1468#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:22,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {1468#(<= main_~i~0 3)} assume true; {1468#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:22,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {1468#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1468#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:22,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {1468#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1469#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:22,589 INFO L273 TraceCheckUtils]: 18: Hoare triple {1469#(<= main_~i~0 4)} assume true; {1469#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:22,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {1469#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1469#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:22,591 INFO L273 TraceCheckUtils]: 20: Hoare triple {1469#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1470#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:22,591 INFO L273 TraceCheckUtils]: 21: Hoare triple {1470#(<= main_~i~0 5)} assume true; {1470#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:22,592 INFO L273 TraceCheckUtils]: 22: Hoare triple {1470#(<= main_~i~0 5)} assume !(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,593 INFO L273 TraceCheckUtils]: 23: Hoare triple {1464#false} ~i~0 := 0; {1464#false} is VALID [2018-11-14 18:54:22,593 INFO L273 TraceCheckUtils]: 24: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,593 INFO L273 TraceCheckUtils]: 25: Hoare triple {1464#false} assume !!(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,594 INFO L273 TraceCheckUtils]: 26: Hoare triple {1464#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1464#false} is VALID [2018-11-14 18:54:22,594 INFO L273 TraceCheckUtils]: 27: Hoare triple {1464#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1464#false} is VALID [2018-11-14 18:54:22,594 INFO L273 TraceCheckUtils]: 28: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,594 INFO L273 TraceCheckUtils]: 29: Hoare triple {1464#false} assume !!(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,595 INFO L273 TraceCheckUtils]: 30: Hoare triple {1464#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1464#false} is VALID [2018-11-14 18:54:22,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {1464#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1464#false} is VALID [2018-11-14 18:54:22,595 INFO L273 TraceCheckUtils]: 32: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,596 INFO L273 TraceCheckUtils]: 33: Hoare triple {1464#false} assume !!(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,596 INFO L273 TraceCheckUtils]: 34: Hoare triple {1464#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1464#false} is VALID [2018-11-14 18:54:22,596 INFO L273 TraceCheckUtils]: 35: Hoare triple {1464#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1464#false} is VALID [2018-11-14 18:54:22,596 INFO L273 TraceCheckUtils]: 36: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,597 INFO L273 TraceCheckUtils]: 37: Hoare triple {1464#false} assume !!(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,597 INFO L273 TraceCheckUtils]: 38: Hoare triple {1464#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1464#false} is VALID [2018-11-14 18:54:22,597 INFO L273 TraceCheckUtils]: 39: Hoare triple {1464#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1464#false} is VALID [2018-11-14 18:54:22,597 INFO L273 TraceCheckUtils]: 40: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,597 INFO L273 TraceCheckUtils]: 41: Hoare triple {1464#false} assume !!(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,598 INFO L273 TraceCheckUtils]: 42: Hoare triple {1464#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1464#false} is VALID [2018-11-14 18:54:22,598 INFO L273 TraceCheckUtils]: 43: Hoare triple {1464#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1464#false} is VALID [2018-11-14 18:54:22,598 INFO L273 TraceCheckUtils]: 44: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,598 INFO L273 TraceCheckUtils]: 45: Hoare triple {1464#false} assume !(~i~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,598 INFO L273 TraceCheckUtils]: 46: Hoare triple {1464#false} havoc ~x~0;~x~0 := 0; {1464#false} is VALID [2018-11-14 18:54:22,599 INFO L273 TraceCheckUtils]: 47: Hoare triple {1464#false} assume true; {1464#false} is VALID [2018-11-14 18:54:22,599 INFO L273 TraceCheckUtils]: 48: Hoare triple {1464#false} assume !!(~x~0 < 200000); {1464#false} is VALID [2018-11-14 18:54:22,599 INFO L273 TraceCheckUtils]: 49: Hoare triple {1464#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {1464#false} is VALID [2018-11-14 18:54:22,599 INFO L256 TraceCheckUtils]: 50: Hoare triple {1464#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1464#false} is VALID [2018-11-14 18:54:22,600 INFO L273 TraceCheckUtils]: 51: Hoare triple {1464#false} ~cond := #in~cond; {1464#false} is VALID [2018-11-14 18:54:22,600 INFO L273 TraceCheckUtils]: 52: Hoare triple {1464#false} assume ~cond == 0; {1464#false} is VALID [2018-11-14 18:54:22,600 INFO L273 TraceCheckUtils]: 53: Hoare triple {1464#false} assume !false; {1464#false} is VALID [2018-11-14 18:54:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-14 18:54:22,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:22,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 18:54:22,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-11-14 18:54:22,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:22,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:54:22,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:22,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:54:22,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:54:22,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:54:22,722 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 9 states. [2018-11-14 18:54:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:23,393 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-11-14 18:54:23,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:54:23,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-11-14 18:54:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:54:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2018-11-14 18:54:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:54:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2018-11-14 18:54:23,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 102 transitions. [2018-11-14 18:54:23,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:23,630 INFO L225 Difference]: With dead ends: 105 [2018-11-14 18:54:23,630 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 18:54:23,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:54:23,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 18:54:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-11-14 18:54:23,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:23,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 66 states. [2018-11-14 18:54:23,702 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 66 states. [2018-11-14 18:54:23,702 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 66 states. [2018-11-14 18:54:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:23,705 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-11-14 18:54:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-14 18:54:23,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:23,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:23,706 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 69 states. [2018-11-14 18:54:23,706 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 69 states. [2018-11-14 18:54:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:23,709 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-11-14 18:54:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-14 18:54:23,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:23,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:23,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:23,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 18:54:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-11-14 18:54:23,712 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 54 [2018-11-14 18:54:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:23,713 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-11-14 18:54:23,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:54:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-14 18:54:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 18:54:23,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:23,715 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:23,715 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:23,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:23,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1326975499, now seen corresponding path program 5 times [2018-11-14 18:54:23,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:23,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:23,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:23,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:23,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:24,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {1993#true} call ULTIMATE.init(); {1993#true} is VALID [2018-11-14 18:54:24,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {1993#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1993#true} is VALID [2018-11-14 18:54:24,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {1993#true} assume true; {1993#true} is VALID [2018-11-14 18:54:24,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1993#true} {1993#true} #76#return; {1993#true} is VALID [2018-11-14 18:54:24,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {1993#true} call #t~ret8 := main(); {1993#true} is VALID [2018-11-14 18:54:24,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {1993#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1995#(= main_~i~0 0)} is VALID [2018-11-14 18:54:24,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {1995#(= main_~i~0 0)} assume true; {1995#(= main_~i~0 0)} is VALID [2018-11-14 18:54:24,076 INFO L273 TraceCheckUtils]: 7: Hoare triple {1995#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1995#(= main_~i~0 0)} is VALID [2018-11-14 18:54:24,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {1995#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1996#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:24,077 INFO L273 TraceCheckUtils]: 9: Hoare triple {1996#(<= main_~i~0 1)} assume true; {1996#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:24,077 INFO L273 TraceCheckUtils]: 10: Hoare triple {1996#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1996#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:24,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {1996#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1997#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:24,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {1997#(<= main_~i~0 2)} assume true; {1997#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:24,087 INFO L273 TraceCheckUtils]: 13: Hoare triple {1997#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1997#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:24,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {1997#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1998#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:24,090 INFO L273 TraceCheckUtils]: 15: Hoare triple {1998#(<= main_~i~0 3)} assume true; {1998#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:24,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {1998#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1998#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:24,091 INFO L273 TraceCheckUtils]: 17: Hoare triple {1998#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1999#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:24,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {1999#(<= main_~i~0 4)} assume true; {1999#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:24,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {1999#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1999#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:24,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {1999#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2000#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:24,093 INFO L273 TraceCheckUtils]: 21: Hoare triple {2000#(<= main_~i~0 5)} assume true; {2000#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:24,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {2000#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2000#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:24,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {2000#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2001#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:24,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {2001#(<= main_~i~0 6)} assume true; {2001#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:24,096 INFO L273 TraceCheckUtils]: 25: Hoare triple {2001#(<= main_~i~0 6)} assume !(~i~0 < 200000); {1994#false} is VALID [2018-11-14 18:54:24,096 INFO L273 TraceCheckUtils]: 26: Hoare triple {1994#false} ~i~0 := 0; {1994#false} is VALID [2018-11-14 18:54:24,097 INFO L273 TraceCheckUtils]: 27: Hoare triple {1994#false} assume true; {1994#false} is VALID [2018-11-14 18:54:24,097 INFO L273 TraceCheckUtils]: 28: Hoare triple {1994#false} assume !!(~i~0 < 200000); {1994#false} is VALID [2018-11-14 18:54:24,097 INFO L273 TraceCheckUtils]: 29: Hoare triple {1994#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1994#false} is VALID [2018-11-14 18:54:24,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {1994#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1994#false} is VALID [2018-11-14 18:54:24,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {1994#false} assume true; {1994#false} is VALID [2018-11-14 18:54:24,098 INFO L273 TraceCheckUtils]: 32: Hoare triple {1994#false} assume !!(~i~0 < 200000); {1994#false} is VALID [2018-11-14 18:54:24,098 INFO L273 TraceCheckUtils]: 33: Hoare triple {1994#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1994#false} is VALID [2018-11-14 18:54:24,099 INFO L273 TraceCheckUtils]: 34: Hoare triple {1994#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1994#false} is VALID [2018-11-14 18:54:24,099 INFO L273 TraceCheckUtils]: 35: Hoare triple {1994#false} assume true; {1994#false} is VALID [2018-11-14 18:54:24,099 INFO L273 TraceCheckUtils]: 36: Hoare triple {1994#false} assume !!(~i~0 < 200000); {1994#false} is VALID [2018-11-14 18:54:24,100 INFO L273 TraceCheckUtils]: 37: Hoare triple {1994#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1994#false} is VALID [2018-11-14 18:54:24,100 INFO L273 TraceCheckUtils]: 38: Hoare triple {1994#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1994#false} is VALID [2018-11-14 18:54:24,100 INFO L273 TraceCheckUtils]: 39: Hoare triple {1994#false} assume true; {1994#false} is VALID [2018-11-14 18:54:24,100 INFO L273 TraceCheckUtils]: 40: Hoare triple {1994#false} assume !!(~i~0 < 200000); {1994#false} is VALID [2018-11-14 18:54:24,101 INFO L273 TraceCheckUtils]: 41: Hoare triple {1994#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1994#false} is VALID [2018-11-14 18:54:24,101 INFO L273 TraceCheckUtils]: 42: Hoare triple {1994#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1994#false} is VALID [2018-11-14 18:54:24,101 INFO L273 TraceCheckUtils]: 43: Hoare triple {1994#false} assume true; {1994#false} is VALID [2018-11-14 18:54:24,102 INFO L273 TraceCheckUtils]: 44: Hoare triple {1994#false} assume !!(~i~0 < 200000); {1994#false} is VALID [2018-11-14 18:54:24,102 INFO L273 TraceCheckUtils]: 45: Hoare triple {1994#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1994#false} is VALID [2018-11-14 18:54:24,102 INFO L273 TraceCheckUtils]: 46: Hoare triple {1994#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1994#false} is VALID [2018-11-14 18:54:24,102 INFO L273 TraceCheckUtils]: 47: Hoare triple {1994#false} assume true; {1994#false} is VALID [2018-11-14 18:54:24,103 INFO L273 TraceCheckUtils]: 48: Hoare triple {1994#false} assume !!(~i~0 < 200000); {1994#false} is VALID [2018-11-14 18:54:24,103 INFO L273 TraceCheckUtils]: 49: Hoare triple {1994#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1994#false} is VALID [2018-11-14 18:54:24,103 INFO L273 TraceCheckUtils]: 50: Hoare triple {1994#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1994#false} is VALID [2018-11-14 18:54:24,103 INFO L273 TraceCheckUtils]: 51: Hoare triple {1994#false} assume true; {1994#false} is VALID [2018-11-14 18:54:24,104 INFO L273 TraceCheckUtils]: 52: Hoare triple {1994#false} assume !(~i~0 < 200000); {1994#false} is VALID [2018-11-14 18:54:24,104 INFO L273 TraceCheckUtils]: 53: Hoare triple {1994#false} havoc ~x~0;~x~0 := 0; {1994#false} is VALID [2018-11-14 18:54:24,104 INFO L273 TraceCheckUtils]: 54: Hoare triple {1994#false} assume true; {1994#false} is VALID [2018-11-14 18:54:24,104 INFO L273 TraceCheckUtils]: 55: Hoare triple {1994#false} assume !!(~x~0 < 200000); {1994#false} is VALID [2018-11-14 18:54:24,105 INFO L273 TraceCheckUtils]: 56: Hoare triple {1994#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {1994#false} is VALID [2018-11-14 18:54:24,105 INFO L256 TraceCheckUtils]: 57: Hoare triple {1994#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1994#false} is VALID [2018-11-14 18:54:24,105 INFO L273 TraceCheckUtils]: 58: Hoare triple {1994#false} ~cond := #in~cond; {1994#false} is VALID [2018-11-14 18:54:24,105 INFO L273 TraceCheckUtils]: 59: Hoare triple {1994#false} assume ~cond == 0; {1994#false} is VALID [2018-11-14 18:54:24,106 INFO L273 TraceCheckUtils]: 60: Hoare triple {1994#false} assume !false; {1994#false} is VALID [2018-11-14 18:54:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-14 18:54:24,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:24,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:24,121 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:54:24,637 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-14 18:54:24,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:24,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:24,951 INFO L256 TraceCheckUtils]: 0: Hoare triple {1993#true} call ULTIMATE.init(); {1993#true} is VALID [2018-11-14 18:54:24,951 INFO L273 TraceCheckUtils]: 1: Hoare triple {1993#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1993#true} is VALID [2018-11-14 18:54:24,951 INFO L273 TraceCheckUtils]: 2: Hoare triple {1993#true} assume true; {1993#true} is VALID [2018-11-14 18:54:24,951 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1993#true} {1993#true} #76#return; {1993#true} is VALID [2018-11-14 18:54:24,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {1993#true} call #t~ret8 := main(); {1993#true} is VALID [2018-11-14 18:54:24,952 INFO L273 TraceCheckUtils]: 5: Hoare triple {1993#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1993#true} is VALID [2018-11-14 18:54:24,952 INFO L273 TraceCheckUtils]: 6: Hoare triple {1993#true} assume true; {1993#true} is VALID [2018-11-14 18:54:24,952 INFO L273 TraceCheckUtils]: 7: Hoare triple {1993#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1993#true} is VALID [2018-11-14 18:54:24,952 INFO L273 TraceCheckUtils]: 8: Hoare triple {1993#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1993#true} is VALID [2018-11-14 18:54:24,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {1993#true} assume true; {1993#true} is VALID [2018-11-14 18:54:24,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {1993#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1993#true} is VALID [2018-11-14 18:54:24,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {1993#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1993#true} is VALID [2018-11-14 18:54:24,953 INFO L273 TraceCheckUtils]: 12: Hoare triple {1993#true} assume true; {1993#true} is VALID [2018-11-14 18:54:24,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {1993#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1993#true} is VALID [2018-11-14 18:54:24,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {1993#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1993#true} is VALID [2018-11-14 18:54:24,953 INFO L273 TraceCheckUtils]: 15: Hoare triple {1993#true} assume true; {1993#true} is VALID [2018-11-14 18:54:24,953 INFO L273 TraceCheckUtils]: 16: Hoare triple {1993#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1993#true} is VALID [2018-11-14 18:54:24,953 INFO L273 TraceCheckUtils]: 17: Hoare triple {1993#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1993#true} is VALID [2018-11-14 18:54:24,954 INFO L273 TraceCheckUtils]: 18: Hoare triple {1993#true} assume true; {1993#true} is VALID [2018-11-14 18:54:24,954 INFO L273 TraceCheckUtils]: 19: Hoare triple {1993#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1993#true} is VALID [2018-11-14 18:54:24,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {1993#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1993#true} is VALID [2018-11-14 18:54:24,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {1993#true} assume true; {1993#true} is VALID [2018-11-14 18:54:24,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {1993#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {1993#true} is VALID [2018-11-14 18:54:24,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {1993#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1993#true} is VALID [2018-11-14 18:54:24,954 INFO L273 TraceCheckUtils]: 24: Hoare triple {1993#true} assume true; {1993#true} is VALID [2018-11-14 18:54:24,954 INFO L273 TraceCheckUtils]: 25: Hoare triple {1993#true} assume !(~i~0 < 200000); {1993#true} is VALID [2018-11-14 18:54:24,955 INFO L273 TraceCheckUtils]: 26: Hoare triple {1993#true} ~i~0 := 0; {2083#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:24,956 INFO L273 TraceCheckUtils]: 27: Hoare triple {2083#(<= main_~i~0 0)} assume true; {2083#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:24,956 INFO L273 TraceCheckUtils]: 28: Hoare triple {2083#(<= main_~i~0 0)} assume !!(~i~0 < 200000); {2083#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:24,959 INFO L273 TraceCheckUtils]: 29: Hoare triple {2083#(<= main_~i~0 0)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2083#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:24,959 INFO L273 TraceCheckUtils]: 30: Hoare triple {2083#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1996#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:24,961 INFO L273 TraceCheckUtils]: 31: Hoare triple {1996#(<= main_~i~0 1)} assume true; {1996#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:24,961 INFO L273 TraceCheckUtils]: 32: Hoare triple {1996#(<= main_~i~0 1)} assume !!(~i~0 < 200000); {1996#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:24,964 INFO L273 TraceCheckUtils]: 33: Hoare triple {1996#(<= main_~i~0 1)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1996#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:24,964 INFO L273 TraceCheckUtils]: 34: Hoare triple {1996#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1997#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:24,966 INFO L273 TraceCheckUtils]: 35: Hoare triple {1997#(<= main_~i~0 2)} assume true; {1997#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:24,971 INFO L273 TraceCheckUtils]: 36: Hoare triple {1997#(<= main_~i~0 2)} assume !!(~i~0 < 200000); {1997#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:24,976 INFO L273 TraceCheckUtils]: 37: Hoare triple {1997#(<= main_~i~0 2)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1997#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:24,976 INFO L273 TraceCheckUtils]: 38: Hoare triple {1997#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1998#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:24,981 INFO L273 TraceCheckUtils]: 39: Hoare triple {1998#(<= main_~i~0 3)} assume true; {1998#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:24,981 INFO L273 TraceCheckUtils]: 40: Hoare triple {1998#(<= main_~i~0 3)} assume !!(~i~0 < 200000); {1998#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:24,984 INFO L273 TraceCheckUtils]: 41: Hoare triple {1998#(<= main_~i~0 3)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1998#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:24,984 INFO L273 TraceCheckUtils]: 42: Hoare triple {1998#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1999#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:24,987 INFO L273 TraceCheckUtils]: 43: Hoare triple {1999#(<= main_~i~0 4)} assume true; {1999#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:24,987 INFO L273 TraceCheckUtils]: 44: Hoare triple {1999#(<= main_~i~0 4)} assume !!(~i~0 < 200000); {1999#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:24,990 INFO L273 TraceCheckUtils]: 45: Hoare triple {1999#(<= main_~i~0 4)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1999#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:24,990 INFO L273 TraceCheckUtils]: 46: Hoare triple {1999#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2000#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:24,992 INFO L273 TraceCheckUtils]: 47: Hoare triple {2000#(<= main_~i~0 5)} assume true; {2000#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:24,992 INFO L273 TraceCheckUtils]: 48: Hoare triple {2000#(<= main_~i~0 5)} assume !!(~i~0 < 200000); {2000#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:24,994 INFO L273 TraceCheckUtils]: 49: Hoare triple {2000#(<= main_~i~0 5)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2000#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:24,996 INFO L273 TraceCheckUtils]: 50: Hoare triple {2000#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2001#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:24,997 INFO L273 TraceCheckUtils]: 51: Hoare triple {2001#(<= main_~i~0 6)} assume true; {2001#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:24,998 INFO L273 TraceCheckUtils]: 52: Hoare triple {2001#(<= main_~i~0 6)} assume !(~i~0 < 200000); {1994#false} is VALID [2018-11-14 18:54:24,998 INFO L273 TraceCheckUtils]: 53: Hoare triple {1994#false} havoc ~x~0;~x~0 := 0; {1994#false} is VALID [2018-11-14 18:54:24,998 INFO L273 TraceCheckUtils]: 54: Hoare triple {1994#false} assume true; {1994#false} is VALID [2018-11-14 18:54:24,998 INFO L273 TraceCheckUtils]: 55: Hoare triple {1994#false} assume !!(~x~0 < 200000); {1994#false} is VALID [2018-11-14 18:54:24,998 INFO L273 TraceCheckUtils]: 56: Hoare triple {1994#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {1994#false} is VALID [2018-11-14 18:54:24,998 INFO L256 TraceCheckUtils]: 57: Hoare triple {1994#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1994#false} is VALID [2018-11-14 18:54:24,999 INFO L273 TraceCheckUtils]: 58: Hoare triple {1994#false} ~cond := #in~cond; {1994#false} is VALID [2018-11-14 18:54:24,999 INFO L273 TraceCheckUtils]: 59: Hoare triple {1994#false} assume ~cond == 0; {1994#false} is VALID [2018-11-14 18:54:24,999 INFO L273 TraceCheckUtils]: 60: Hoare triple {1994#false} assume !false; {1994#false} is VALID [2018-11-14 18:54:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-14 18:54:25,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:25,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 18:54:25,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-11-14 18:54:25,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:25,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:54:25,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:25,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:54:25,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:54:25,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:54:25,119 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 10 states. [2018-11-14 18:54:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:25,671 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2018-11-14 18:54:25,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:54:25,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-11-14 18:54:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:54:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2018-11-14 18:54:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:54:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2018-11-14 18:54:25,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 110 transitions. [2018-11-14 18:54:25,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:25,956 INFO L225 Difference]: With dead ends: 116 [2018-11-14 18:54:25,956 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 18:54:25,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:54:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 18:54:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-11-14 18:54:25,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:25,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 73 states. [2018-11-14 18:54:25,989 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 73 states. [2018-11-14 18:54:25,989 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 73 states. [2018-11-14 18:54:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:25,993 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 18:54:25,993 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-14 18:54:25,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:25,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:25,994 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 76 states. [2018-11-14 18:54:25,994 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 76 states. [2018-11-14 18:54:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:25,996 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 18:54:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-14 18:54:25,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:25,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:25,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:25,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-14 18:54:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2018-11-14 18:54:26,000 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 61 [2018-11-14 18:54:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:26,001 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2018-11-14 18:54:26,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:54:26,001 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2018-11-14 18:54:26,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-14 18:54:26,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:26,002 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:26,002 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:26,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:26,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1780461893, now seen corresponding path program 6 times [2018-11-14 18:54:26,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:26,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:26,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:26,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:26,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:26,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {2582#true} call ULTIMATE.init(); {2582#true} is VALID [2018-11-14 18:54:26,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {2582#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2582#true} is VALID [2018-11-14 18:54:26,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {2582#true} assume true; {2582#true} is VALID [2018-11-14 18:54:26,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2582#true} {2582#true} #76#return; {2582#true} is VALID [2018-11-14 18:54:26,262 INFO L256 TraceCheckUtils]: 4: Hoare triple {2582#true} call #t~ret8 := main(); {2582#true} is VALID [2018-11-14 18:54:26,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {2582#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {2584#(= main_~i~0 0)} is VALID [2018-11-14 18:54:26,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {2584#(= main_~i~0 0)} assume true; {2584#(= main_~i~0 0)} is VALID [2018-11-14 18:54:26,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {2584#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2584#(= main_~i~0 0)} is VALID [2018-11-14 18:54:26,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {2584#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2585#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:26,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {2585#(<= main_~i~0 1)} assume true; {2585#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:26,269 INFO L273 TraceCheckUtils]: 10: Hoare triple {2585#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2585#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:26,269 INFO L273 TraceCheckUtils]: 11: Hoare triple {2585#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2586#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:26,270 INFO L273 TraceCheckUtils]: 12: Hoare triple {2586#(<= main_~i~0 2)} assume true; {2586#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:26,270 INFO L273 TraceCheckUtils]: 13: Hoare triple {2586#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2586#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:26,271 INFO L273 TraceCheckUtils]: 14: Hoare triple {2586#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2587#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:26,271 INFO L273 TraceCheckUtils]: 15: Hoare triple {2587#(<= main_~i~0 3)} assume true; {2587#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:26,272 INFO L273 TraceCheckUtils]: 16: Hoare triple {2587#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2587#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:26,273 INFO L273 TraceCheckUtils]: 17: Hoare triple {2587#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2588#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:26,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {2588#(<= main_~i~0 4)} assume true; {2588#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:26,274 INFO L273 TraceCheckUtils]: 19: Hoare triple {2588#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2588#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:26,276 INFO L273 TraceCheckUtils]: 20: Hoare triple {2588#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2589#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:26,276 INFO L273 TraceCheckUtils]: 21: Hoare triple {2589#(<= main_~i~0 5)} assume true; {2589#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:26,277 INFO L273 TraceCheckUtils]: 22: Hoare triple {2589#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2589#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:26,277 INFO L273 TraceCheckUtils]: 23: Hoare triple {2589#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2590#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:26,278 INFO L273 TraceCheckUtils]: 24: Hoare triple {2590#(<= main_~i~0 6)} assume true; {2590#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:26,278 INFO L273 TraceCheckUtils]: 25: Hoare triple {2590#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2590#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:26,278 INFO L273 TraceCheckUtils]: 26: Hoare triple {2590#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2591#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:26,279 INFO L273 TraceCheckUtils]: 27: Hoare triple {2591#(<= main_~i~0 7)} assume true; {2591#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:26,279 INFO L273 TraceCheckUtils]: 28: Hoare triple {2591#(<= main_~i~0 7)} assume !(~i~0 < 200000); {2583#false} is VALID [2018-11-14 18:54:26,279 INFO L273 TraceCheckUtils]: 29: Hoare triple {2583#false} ~i~0 := 0; {2583#false} is VALID [2018-11-14 18:54:26,280 INFO L273 TraceCheckUtils]: 30: Hoare triple {2583#false} assume true; {2583#false} is VALID [2018-11-14 18:54:26,280 INFO L273 TraceCheckUtils]: 31: Hoare triple {2583#false} assume !!(~i~0 < 200000); {2583#false} is VALID [2018-11-14 18:54:26,280 INFO L273 TraceCheckUtils]: 32: Hoare triple {2583#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2583#false} is VALID [2018-11-14 18:54:26,280 INFO L273 TraceCheckUtils]: 33: Hoare triple {2583#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2583#false} is VALID [2018-11-14 18:54:26,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {2583#false} assume true; {2583#false} is VALID [2018-11-14 18:54:26,280 INFO L273 TraceCheckUtils]: 35: Hoare triple {2583#false} assume !!(~i~0 < 200000); {2583#false} is VALID [2018-11-14 18:54:26,281 INFO L273 TraceCheckUtils]: 36: Hoare triple {2583#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2583#false} is VALID [2018-11-14 18:54:26,281 INFO L273 TraceCheckUtils]: 37: Hoare triple {2583#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2583#false} is VALID [2018-11-14 18:54:26,281 INFO L273 TraceCheckUtils]: 38: Hoare triple {2583#false} assume true; {2583#false} is VALID [2018-11-14 18:54:26,281 INFO L273 TraceCheckUtils]: 39: Hoare triple {2583#false} assume !!(~i~0 < 200000); {2583#false} is VALID [2018-11-14 18:54:26,282 INFO L273 TraceCheckUtils]: 40: Hoare triple {2583#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2583#false} is VALID [2018-11-14 18:54:26,282 INFO L273 TraceCheckUtils]: 41: Hoare triple {2583#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2583#false} is VALID [2018-11-14 18:54:26,282 INFO L273 TraceCheckUtils]: 42: Hoare triple {2583#false} assume true; {2583#false} is VALID [2018-11-14 18:54:26,282 INFO L273 TraceCheckUtils]: 43: Hoare triple {2583#false} assume !!(~i~0 < 200000); {2583#false} is VALID [2018-11-14 18:54:26,283 INFO L273 TraceCheckUtils]: 44: Hoare triple {2583#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2583#false} is VALID [2018-11-14 18:54:26,283 INFO L273 TraceCheckUtils]: 45: Hoare triple {2583#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2583#false} is VALID [2018-11-14 18:54:26,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {2583#false} assume true; {2583#false} is VALID [2018-11-14 18:54:26,284 INFO L273 TraceCheckUtils]: 47: Hoare triple {2583#false} assume !!(~i~0 < 200000); {2583#false} is VALID [2018-11-14 18:54:26,284 INFO L273 TraceCheckUtils]: 48: Hoare triple {2583#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2583#false} is VALID [2018-11-14 18:54:26,284 INFO L273 TraceCheckUtils]: 49: Hoare triple {2583#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2583#false} is VALID [2018-11-14 18:54:26,284 INFO L273 TraceCheckUtils]: 50: Hoare triple {2583#false} assume true; {2583#false} is VALID [2018-11-14 18:54:26,284 INFO L273 TraceCheckUtils]: 51: Hoare triple {2583#false} assume !!(~i~0 < 200000); {2583#false} is VALID [2018-11-14 18:54:26,285 INFO L273 TraceCheckUtils]: 52: Hoare triple {2583#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2583#false} is VALID [2018-11-14 18:54:26,285 INFO L273 TraceCheckUtils]: 53: Hoare triple {2583#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2583#false} is VALID [2018-11-14 18:54:26,285 INFO L273 TraceCheckUtils]: 54: Hoare triple {2583#false} assume true; {2583#false} is VALID [2018-11-14 18:54:26,285 INFO L273 TraceCheckUtils]: 55: Hoare triple {2583#false} assume !!(~i~0 < 200000); {2583#false} is VALID [2018-11-14 18:54:26,285 INFO L273 TraceCheckUtils]: 56: Hoare triple {2583#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2583#false} is VALID [2018-11-14 18:54:26,286 INFO L273 TraceCheckUtils]: 57: Hoare triple {2583#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2583#false} is VALID [2018-11-14 18:54:26,286 INFO L273 TraceCheckUtils]: 58: Hoare triple {2583#false} assume true; {2583#false} is VALID [2018-11-14 18:54:26,286 INFO L273 TraceCheckUtils]: 59: Hoare triple {2583#false} assume !(~i~0 < 200000); {2583#false} is VALID [2018-11-14 18:54:26,286 INFO L273 TraceCheckUtils]: 60: Hoare triple {2583#false} havoc ~x~0;~x~0 := 0; {2583#false} is VALID [2018-11-14 18:54:26,286 INFO L273 TraceCheckUtils]: 61: Hoare triple {2583#false} assume true; {2583#false} is VALID [2018-11-14 18:54:26,287 INFO L273 TraceCheckUtils]: 62: Hoare triple {2583#false} assume !!(~x~0 < 200000); {2583#false} is VALID [2018-11-14 18:54:26,287 INFO L273 TraceCheckUtils]: 63: Hoare triple {2583#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {2583#false} is VALID [2018-11-14 18:54:26,287 INFO L256 TraceCheckUtils]: 64: Hoare triple {2583#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2583#false} is VALID [2018-11-14 18:54:26,287 INFO L273 TraceCheckUtils]: 65: Hoare triple {2583#false} ~cond := #in~cond; {2583#false} is VALID [2018-11-14 18:54:26,287 INFO L273 TraceCheckUtils]: 66: Hoare triple {2583#false} assume ~cond == 0; {2583#false} is VALID [2018-11-14 18:54:26,288 INFO L273 TraceCheckUtils]: 67: Hoare triple {2583#false} assume !false; {2583#false} is VALID [2018-11-14 18:54:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-14 18:54:26,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:26,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:26,300 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:54:27,192 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-14 18:54:27,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:27,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:27,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {2582#true} call ULTIMATE.init(); {2582#true} is VALID [2018-11-14 18:54:27,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {2582#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2582#true} is VALID [2018-11-14 18:54:27,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {2582#true} assume true; {2582#true} is VALID [2018-11-14 18:54:27,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2582#true} {2582#true} #76#return; {2582#true} is VALID [2018-11-14 18:54:27,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {2582#true} call #t~ret8 := main(); {2582#true} is VALID [2018-11-14 18:54:27,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {2582#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {2582#true} is VALID [2018-11-14 18:54:27,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {2582#true} assume true; {2582#true} is VALID [2018-11-14 18:54:27,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {2582#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2582#true} is VALID [2018-11-14 18:54:27,421 INFO L273 TraceCheckUtils]: 8: Hoare triple {2582#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2582#true} is VALID [2018-11-14 18:54:27,421 INFO L273 TraceCheckUtils]: 9: Hoare triple {2582#true} assume true; {2582#true} is VALID [2018-11-14 18:54:27,422 INFO L273 TraceCheckUtils]: 10: Hoare triple {2582#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2582#true} is VALID [2018-11-14 18:54:27,422 INFO L273 TraceCheckUtils]: 11: Hoare triple {2582#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2582#true} is VALID [2018-11-14 18:54:27,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {2582#true} assume true; {2582#true} is VALID [2018-11-14 18:54:27,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {2582#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2582#true} is VALID [2018-11-14 18:54:27,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {2582#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2582#true} is VALID [2018-11-14 18:54:27,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {2582#true} assume true; {2582#true} is VALID [2018-11-14 18:54:27,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {2582#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2582#true} is VALID [2018-11-14 18:54:27,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {2582#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2582#true} is VALID [2018-11-14 18:54:27,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {2582#true} assume true; {2582#true} is VALID [2018-11-14 18:54:27,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {2582#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2582#true} is VALID [2018-11-14 18:54:27,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {2582#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2582#true} is VALID [2018-11-14 18:54:27,423 INFO L273 TraceCheckUtils]: 21: Hoare triple {2582#true} assume true; {2582#true} is VALID [2018-11-14 18:54:27,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {2582#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2582#true} is VALID [2018-11-14 18:54:27,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {2582#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2582#true} is VALID [2018-11-14 18:54:27,423 INFO L273 TraceCheckUtils]: 24: Hoare triple {2582#true} assume true; {2582#true} is VALID [2018-11-14 18:54:27,424 INFO L273 TraceCheckUtils]: 25: Hoare triple {2582#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {2670#(< main_~i~0 200000)} is VALID [2018-11-14 18:54:27,424 INFO L273 TraceCheckUtils]: 26: Hoare triple {2670#(< main_~i~0 200000)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2674#(<= main_~i~0 200000)} is VALID [2018-11-14 18:54:27,425 INFO L273 TraceCheckUtils]: 27: Hoare triple {2674#(<= main_~i~0 200000)} assume true; {2674#(<= main_~i~0 200000)} is VALID [2018-11-14 18:54:27,425 INFO L273 TraceCheckUtils]: 28: Hoare triple {2674#(<= main_~i~0 200000)} assume !(~i~0 < 200000); {2582#true} is VALID [2018-11-14 18:54:27,425 INFO L273 TraceCheckUtils]: 29: Hoare triple {2582#true} ~i~0 := 0; {2684#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:27,426 INFO L273 TraceCheckUtils]: 30: Hoare triple {2684#(<= main_~i~0 0)} assume true; {2684#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:27,426 INFO L273 TraceCheckUtils]: 31: Hoare triple {2684#(<= main_~i~0 0)} assume !!(~i~0 < 200000); {2684#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:27,427 INFO L273 TraceCheckUtils]: 32: Hoare triple {2684#(<= main_~i~0 0)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2684#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:27,431 INFO L273 TraceCheckUtils]: 33: Hoare triple {2684#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2585#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:27,431 INFO L273 TraceCheckUtils]: 34: Hoare triple {2585#(<= main_~i~0 1)} assume true; {2585#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:27,432 INFO L273 TraceCheckUtils]: 35: Hoare triple {2585#(<= main_~i~0 1)} assume !!(~i~0 < 200000); {2585#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:27,432 INFO L273 TraceCheckUtils]: 36: Hoare triple {2585#(<= main_~i~0 1)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2585#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:27,433 INFO L273 TraceCheckUtils]: 37: Hoare triple {2585#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2586#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:27,433 INFO L273 TraceCheckUtils]: 38: Hoare triple {2586#(<= main_~i~0 2)} assume true; {2586#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:27,433 INFO L273 TraceCheckUtils]: 39: Hoare triple {2586#(<= main_~i~0 2)} assume !!(~i~0 < 200000); {2586#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:27,434 INFO L273 TraceCheckUtils]: 40: Hoare triple {2586#(<= main_~i~0 2)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2586#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:27,434 INFO L273 TraceCheckUtils]: 41: Hoare triple {2586#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2587#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:27,434 INFO L273 TraceCheckUtils]: 42: Hoare triple {2587#(<= main_~i~0 3)} assume true; {2587#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:27,435 INFO L273 TraceCheckUtils]: 43: Hoare triple {2587#(<= main_~i~0 3)} assume !!(~i~0 < 200000); {2587#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:27,435 INFO L273 TraceCheckUtils]: 44: Hoare triple {2587#(<= main_~i~0 3)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2587#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:27,436 INFO L273 TraceCheckUtils]: 45: Hoare triple {2587#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2588#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:27,436 INFO L273 TraceCheckUtils]: 46: Hoare triple {2588#(<= main_~i~0 4)} assume true; {2588#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:27,437 INFO L273 TraceCheckUtils]: 47: Hoare triple {2588#(<= main_~i~0 4)} assume !!(~i~0 < 200000); {2588#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:27,438 INFO L273 TraceCheckUtils]: 48: Hoare triple {2588#(<= main_~i~0 4)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2588#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:27,438 INFO L273 TraceCheckUtils]: 49: Hoare triple {2588#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2589#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:27,439 INFO L273 TraceCheckUtils]: 50: Hoare triple {2589#(<= main_~i~0 5)} assume true; {2589#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:27,440 INFO L273 TraceCheckUtils]: 51: Hoare triple {2589#(<= main_~i~0 5)} assume !!(~i~0 < 200000); {2589#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:27,440 INFO L273 TraceCheckUtils]: 52: Hoare triple {2589#(<= main_~i~0 5)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2589#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:27,441 INFO L273 TraceCheckUtils]: 53: Hoare triple {2589#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2590#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:27,442 INFO L273 TraceCheckUtils]: 54: Hoare triple {2590#(<= main_~i~0 6)} assume true; {2590#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:27,442 INFO L273 TraceCheckUtils]: 55: Hoare triple {2590#(<= main_~i~0 6)} assume !!(~i~0 < 200000); {2590#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:27,443 INFO L273 TraceCheckUtils]: 56: Hoare triple {2590#(<= main_~i~0 6)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2590#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:27,444 INFO L273 TraceCheckUtils]: 57: Hoare triple {2590#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2591#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:27,444 INFO L273 TraceCheckUtils]: 58: Hoare triple {2591#(<= main_~i~0 7)} assume true; {2591#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:27,445 INFO L273 TraceCheckUtils]: 59: Hoare triple {2591#(<= main_~i~0 7)} assume !(~i~0 < 200000); {2583#false} is VALID [2018-11-14 18:54:27,445 INFO L273 TraceCheckUtils]: 60: Hoare triple {2583#false} havoc ~x~0;~x~0 := 0; {2583#false} is VALID [2018-11-14 18:54:27,445 INFO L273 TraceCheckUtils]: 61: Hoare triple {2583#false} assume true; {2583#false} is VALID [2018-11-14 18:54:27,446 INFO L273 TraceCheckUtils]: 62: Hoare triple {2583#false} assume !!(~x~0 < 200000); {2583#false} is VALID [2018-11-14 18:54:27,446 INFO L273 TraceCheckUtils]: 63: Hoare triple {2583#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {2583#false} is VALID [2018-11-14 18:54:27,446 INFO L256 TraceCheckUtils]: 64: Hoare triple {2583#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2583#false} is VALID [2018-11-14 18:54:27,446 INFO L273 TraceCheckUtils]: 65: Hoare triple {2583#false} ~cond := #in~cond; {2583#false} is VALID [2018-11-14 18:54:27,447 INFO L273 TraceCheckUtils]: 66: Hoare triple {2583#false} assume ~cond == 0; {2583#false} is VALID [2018-11-14 18:54:27,447 INFO L273 TraceCheckUtils]: 67: Hoare triple {2583#false} assume !false; {2583#false} is VALID [2018-11-14 18:54:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 20 proven. 98 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-14 18:54:27,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:27,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2018-11-14 18:54:27,473 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-11-14 18:54:27,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:27,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:54:27,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:27,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:54:27,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:54:27,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:54:27,557 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 13 states. [2018-11-14 18:54:28,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:28,074 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2018-11-14 18:54:28,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:54:28,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-11-14 18:54:28,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:54:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2018-11-14 18:54:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:54:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2018-11-14 18:54:28,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 124 transitions. [2018-11-14 18:54:28,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:28,273 INFO L225 Difference]: With dead ends: 131 [2018-11-14 18:54:28,273 INFO L226 Difference]: Without dead ends: 87 [2018-11-14 18:54:28,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:54:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-14 18:54:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-14 18:54:28,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:28,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 87 states. [2018-11-14 18:54:28,315 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2018-11-14 18:54:28,315 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2018-11-14 18:54:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:28,318 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2018-11-14 18:54:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-11-14 18:54:28,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:28,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:28,319 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2018-11-14 18:54:28,319 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2018-11-14 18:54:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:28,321 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2018-11-14 18:54:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-11-14 18:54:28,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:28,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:28,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:28,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-14 18:54:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2018-11-14 18:54:28,324 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 68 [2018-11-14 18:54:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:28,324 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2018-11-14 18:54:28,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:54:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-11-14 18:54:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-14 18:54:28,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:28,326 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:28,326 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:28,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:28,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1894659411, now seen corresponding path program 7 times [2018-11-14 18:54:28,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:28,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:28,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:28,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:28,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:28,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {3255#true} call ULTIMATE.init(); {3255#true} is VALID [2018-11-14 18:54:28,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {3255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3255#true} is VALID [2018-11-14 18:54:28,715 INFO L273 TraceCheckUtils]: 2: Hoare triple {3255#true} assume true; {3255#true} is VALID [2018-11-14 18:54:28,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3255#true} {3255#true} #76#return; {3255#true} is VALID [2018-11-14 18:54:28,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {3255#true} call #t~ret8 := main(); {3255#true} is VALID [2018-11-14 18:54:28,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {3255#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {3257#(= main_~i~0 0)} is VALID [2018-11-14 18:54:28,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {3257#(= main_~i~0 0)} assume true; {3257#(= main_~i~0 0)} is VALID [2018-11-14 18:54:28,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {3257#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3257#(= main_~i~0 0)} is VALID [2018-11-14 18:54:28,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {3257#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3258#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:28,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {3258#(<= main_~i~0 1)} assume true; {3258#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:28,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {3258#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3258#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:28,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {3258#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3259#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:28,719 INFO L273 TraceCheckUtils]: 12: Hoare triple {3259#(<= main_~i~0 2)} assume true; {3259#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:28,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {3259#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3259#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:28,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {3259#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3260#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:28,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {3260#(<= main_~i~0 3)} assume true; {3260#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:28,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {3260#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3260#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:28,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {3260#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3261#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:28,723 INFO L273 TraceCheckUtils]: 18: Hoare triple {3261#(<= main_~i~0 4)} assume true; {3261#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:28,723 INFO L273 TraceCheckUtils]: 19: Hoare triple {3261#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3261#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:28,724 INFO L273 TraceCheckUtils]: 20: Hoare triple {3261#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3262#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:28,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {3262#(<= main_~i~0 5)} assume true; {3262#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:28,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {3262#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3262#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:28,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {3262#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3263#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:28,727 INFO L273 TraceCheckUtils]: 24: Hoare triple {3263#(<= main_~i~0 6)} assume true; {3263#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:28,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {3263#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3263#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:28,728 INFO L273 TraceCheckUtils]: 26: Hoare triple {3263#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3264#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:28,729 INFO L273 TraceCheckUtils]: 27: Hoare triple {3264#(<= main_~i~0 7)} assume true; {3264#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:28,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {3264#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3264#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:28,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {3264#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3265#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:28,748 INFO L273 TraceCheckUtils]: 30: Hoare triple {3265#(<= main_~i~0 8)} assume true; {3265#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:28,762 INFO L273 TraceCheckUtils]: 31: Hoare triple {3265#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3265#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:28,771 INFO L273 TraceCheckUtils]: 32: Hoare triple {3265#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3266#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:28,785 INFO L273 TraceCheckUtils]: 33: Hoare triple {3266#(<= main_~i~0 9)} assume true; {3266#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:28,794 INFO L273 TraceCheckUtils]: 34: Hoare triple {3266#(<= main_~i~0 9)} assume !(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:28,794 INFO L273 TraceCheckUtils]: 35: Hoare triple {3256#false} ~i~0 := 0; {3256#false} is VALID [2018-11-14 18:54:28,794 INFO L273 TraceCheckUtils]: 36: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:28,795 INFO L273 TraceCheckUtils]: 37: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:28,795 INFO L273 TraceCheckUtils]: 38: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:28,795 INFO L273 TraceCheckUtils]: 39: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:28,795 INFO L273 TraceCheckUtils]: 40: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:28,796 INFO L273 TraceCheckUtils]: 41: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:28,796 INFO L273 TraceCheckUtils]: 42: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:28,796 INFO L273 TraceCheckUtils]: 43: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:28,796 INFO L273 TraceCheckUtils]: 44: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:28,796 INFO L273 TraceCheckUtils]: 45: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:28,796 INFO L273 TraceCheckUtils]: 46: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:28,800 INFO L273 TraceCheckUtils]: 47: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:28,800 INFO L273 TraceCheckUtils]: 48: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:28,800 INFO L273 TraceCheckUtils]: 49: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:28,800 INFO L273 TraceCheckUtils]: 50: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:28,801 INFO L273 TraceCheckUtils]: 51: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:28,801 INFO L273 TraceCheckUtils]: 52: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:28,801 INFO L273 TraceCheckUtils]: 53: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:28,801 INFO L273 TraceCheckUtils]: 54: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:28,801 INFO L273 TraceCheckUtils]: 55: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:28,801 INFO L273 TraceCheckUtils]: 56: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:28,805 INFO L273 TraceCheckUtils]: 57: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:28,805 INFO L273 TraceCheckUtils]: 58: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:28,805 INFO L273 TraceCheckUtils]: 59: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:28,805 INFO L273 TraceCheckUtils]: 60: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:28,806 INFO L273 TraceCheckUtils]: 61: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:28,806 INFO L273 TraceCheckUtils]: 62: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:28,806 INFO L273 TraceCheckUtils]: 63: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:28,806 INFO L273 TraceCheckUtils]: 64: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:28,807 INFO L273 TraceCheckUtils]: 65: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:28,809 INFO L273 TraceCheckUtils]: 66: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:28,809 INFO L273 TraceCheckUtils]: 67: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:28,809 INFO L273 TraceCheckUtils]: 68: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:28,810 INFO L273 TraceCheckUtils]: 69: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:28,810 INFO L273 TraceCheckUtils]: 70: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:28,810 INFO L273 TraceCheckUtils]: 71: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:28,810 INFO L273 TraceCheckUtils]: 72: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:28,810 INFO L273 TraceCheckUtils]: 73: Hoare triple {3256#false} assume !(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:28,811 INFO L273 TraceCheckUtils]: 74: Hoare triple {3256#false} havoc ~x~0;~x~0 := 0; {3256#false} is VALID [2018-11-14 18:54:28,811 INFO L273 TraceCheckUtils]: 75: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:28,811 INFO L273 TraceCheckUtils]: 76: Hoare triple {3256#false} assume !!(~x~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:28,811 INFO L273 TraceCheckUtils]: 77: Hoare triple {3256#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {3256#false} is VALID [2018-11-14 18:54:28,811 INFO L256 TraceCheckUtils]: 78: Hoare triple {3256#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3256#false} is VALID [2018-11-14 18:54:28,814 INFO L273 TraceCheckUtils]: 79: Hoare triple {3256#false} ~cond := #in~cond; {3256#false} is VALID [2018-11-14 18:54:28,814 INFO L273 TraceCheckUtils]: 80: Hoare triple {3256#false} assume ~cond == 0; {3256#false} is VALID [2018-11-14 18:54:28,814 INFO L273 TraceCheckUtils]: 81: Hoare triple {3256#false} assume !false; {3256#false} is VALID [2018-11-14 18:54:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-14 18:54:28,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:28,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:28,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:28,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:29,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {3255#true} call ULTIMATE.init(); {3255#true} is VALID [2018-11-14 18:54:29,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {3255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3255#true} is VALID [2018-11-14 18:54:29,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {3255#true} assume true; {3255#true} is VALID [2018-11-14 18:54:29,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3255#true} {3255#true} #76#return; {3255#true} is VALID [2018-11-14 18:54:29,081 INFO L256 TraceCheckUtils]: 4: Hoare triple {3255#true} call #t~ret8 := main(); {3255#true} is VALID [2018-11-14 18:54:29,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {3255#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {3285#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:29,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {3285#(<= main_~i~0 0)} assume true; {3285#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:29,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {3285#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3285#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:29,106 INFO L273 TraceCheckUtils]: 8: Hoare triple {3285#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3258#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:29,106 INFO L273 TraceCheckUtils]: 9: Hoare triple {3258#(<= main_~i~0 1)} assume true; {3258#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:29,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {3258#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3258#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:29,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {3258#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3259#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:29,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {3259#(<= main_~i~0 2)} assume true; {3259#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:29,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {3259#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3259#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:29,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {3259#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3260#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:29,109 INFO L273 TraceCheckUtils]: 15: Hoare triple {3260#(<= main_~i~0 3)} assume true; {3260#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:29,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {3260#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3260#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:29,109 INFO L273 TraceCheckUtils]: 17: Hoare triple {3260#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3261#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:29,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {3261#(<= main_~i~0 4)} assume true; {3261#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:29,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {3261#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3261#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:29,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {3261#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3262#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:29,112 INFO L273 TraceCheckUtils]: 21: Hoare triple {3262#(<= main_~i~0 5)} assume true; {3262#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:29,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {3262#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3262#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:29,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {3262#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3263#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:29,113 INFO L273 TraceCheckUtils]: 24: Hoare triple {3263#(<= main_~i~0 6)} assume true; {3263#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:29,114 INFO L273 TraceCheckUtils]: 25: Hoare triple {3263#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3263#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:29,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {3263#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3264#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:29,115 INFO L273 TraceCheckUtils]: 27: Hoare triple {3264#(<= main_~i~0 7)} assume true; {3264#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:29,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {3264#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3264#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:29,117 INFO L273 TraceCheckUtils]: 29: Hoare triple {3264#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3265#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:29,117 INFO L273 TraceCheckUtils]: 30: Hoare triple {3265#(<= main_~i~0 8)} assume true; {3265#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:29,118 INFO L273 TraceCheckUtils]: 31: Hoare triple {3265#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {3265#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:29,118 INFO L273 TraceCheckUtils]: 32: Hoare triple {3265#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3266#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:29,119 INFO L273 TraceCheckUtils]: 33: Hoare triple {3266#(<= main_~i~0 9)} assume true; {3266#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:29,120 INFO L273 TraceCheckUtils]: 34: Hoare triple {3266#(<= main_~i~0 9)} assume !(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:29,120 INFO L273 TraceCheckUtils]: 35: Hoare triple {3256#false} ~i~0 := 0; {3256#false} is VALID [2018-11-14 18:54:29,120 INFO L273 TraceCheckUtils]: 36: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:29,120 INFO L273 TraceCheckUtils]: 37: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:29,121 INFO L273 TraceCheckUtils]: 38: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:29,121 INFO L273 TraceCheckUtils]: 39: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:29,121 INFO L273 TraceCheckUtils]: 40: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:29,121 INFO L273 TraceCheckUtils]: 41: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:29,121 INFO L273 TraceCheckUtils]: 42: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:29,122 INFO L273 TraceCheckUtils]: 43: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:29,122 INFO L273 TraceCheckUtils]: 44: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:29,122 INFO L273 TraceCheckUtils]: 45: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:29,122 INFO L273 TraceCheckUtils]: 46: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:29,123 INFO L273 TraceCheckUtils]: 47: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:29,123 INFO L273 TraceCheckUtils]: 48: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:29,123 INFO L273 TraceCheckUtils]: 49: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:29,123 INFO L273 TraceCheckUtils]: 50: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:29,123 INFO L273 TraceCheckUtils]: 51: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:29,123 INFO L273 TraceCheckUtils]: 52: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:29,123 INFO L273 TraceCheckUtils]: 53: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:29,123 INFO L273 TraceCheckUtils]: 54: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:29,123 INFO L273 TraceCheckUtils]: 55: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:29,124 INFO L273 TraceCheckUtils]: 56: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:29,124 INFO L273 TraceCheckUtils]: 57: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:29,124 INFO L273 TraceCheckUtils]: 58: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:29,124 INFO L273 TraceCheckUtils]: 59: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:29,124 INFO L273 TraceCheckUtils]: 60: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:29,124 INFO L273 TraceCheckUtils]: 61: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:29,124 INFO L273 TraceCheckUtils]: 62: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:29,124 INFO L273 TraceCheckUtils]: 63: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:29,125 INFO L273 TraceCheckUtils]: 64: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:29,125 INFO L273 TraceCheckUtils]: 65: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:29,125 INFO L273 TraceCheckUtils]: 66: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:29,125 INFO L273 TraceCheckUtils]: 67: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:29,125 INFO L273 TraceCheckUtils]: 68: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:29,125 INFO L273 TraceCheckUtils]: 69: Hoare triple {3256#false} assume !!(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:29,125 INFO L273 TraceCheckUtils]: 70: Hoare triple {3256#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3256#false} is VALID [2018-11-14 18:54:29,125 INFO L273 TraceCheckUtils]: 71: Hoare triple {3256#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3256#false} is VALID [2018-11-14 18:54:29,126 INFO L273 TraceCheckUtils]: 72: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:29,126 INFO L273 TraceCheckUtils]: 73: Hoare triple {3256#false} assume !(~i~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:29,126 INFO L273 TraceCheckUtils]: 74: Hoare triple {3256#false} havoc ~x~0;~x~0 := 0; {3256#false} is VALID [2018-11-14 18:54:29,126 INFO L273 TraceCheckUtils]: 75: Hoare triple {3256#false} assume true; {3256#false} is VALID [2018-11-14 18:54:29,126 INFO L273 TraceCheckUtils]: 76: Hoare triple {3256#false} assume !!(~x~0 < 200000); {3256#false} is VALID [2018-11-14 18:54:29,126 INFO L273 TraceCheckUtils]: 77: Hoare triple {3256#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {3256#false} is VALID [2018-11-14 18:54:29,126 INFO L256 TraceCheckUtils]: 78: Hoare triple {3256#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3256#false} is VALID [2018-11-14 18:54:29,126 INFO L273 TraceCheckUtils]: 79: Hoare triple {3256#false} ~cond := #in~cond; {3256#false} is VALID [2018-11-14 18:54:29,127 INFO L273 TraceCheckUtils]: 80: Hoare triple {3256#false} assume ~cond == 0; {3256#false} is VALID [2018-11-14 18:54:29,127 INFO L273 TraceCheckUtils]: 81: Hoare triple {3256#false} assume !false; {3256#false} is VALID [2018-11-14 18:54:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-14 18:54:29,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:29,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 18:54:29,151 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2018-11-14 18:54:29,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:29,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:54:29,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:29,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:54:29,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:54:29,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:54:29,200 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 13 states. [2018-11-14 18:54:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:29,530 INFO L93 Difference]: Finished difference Result 149 states and 176 transitions. [2018-11-14 18:54:29,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:54:29,530 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2018-11-14 18:54:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:54:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2018-11-14 18:54:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:54:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2018-11-14 18:54:29,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 134 transitions. [2018-11-14 18:54:29,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:29,684 INFO L225 Difference]: With dead ends: 149 [2018-11-14 18:54:29,684 INFO L226 Difference]: Without dead ends: 97 [2018-11-14 18:54:29,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:54:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-14 18:54:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-11-14 18:54:29,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:29,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 94 states. [2018-11-14 18:54:29,728 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 94 states. [2018-11-14 18:54:29,729 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 94 states. [2018-11-14 18:54:29,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:29,732 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2018-11-14 18:54:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2018-11-14 18:54:29,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:29,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:29,733 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 97 states. [2018-11-14 18:54:29,733 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 97 states. [2018-11-14 18:54:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:29,736 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2018-11-14 18:54:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2018-11-14 18:54:29,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:29,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:29,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:29,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 18:54:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2018-11-14 18:54:29,740 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 82 [2018-11-14 18:54:29,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:29,740 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2018-11-14 18:54:29,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:54:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2018-11-14 18:54:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-14 18:54:29,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:29,742 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:29,742 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:29,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:29,742 INFO L82 PathProgramCache]: Analyzing trace with hash -614102417, now seen corresponding path program 8 times [2018-11-14 18:54:29,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:29,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:29,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:29,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:29,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:30,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {4021#true} call ULTIMATE.init(); {4021#true} is VALID [2018-11-14 18:54:30,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {4021#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4021#true} is VALID [2018-11-14 18:54:30,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {4021#true} assume true; {4021#true} is VALID [2018-11-14 18:54:30,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4021#true} {4021#true} #76#return; {4021#true} is VALID [2018-11-14 18:54:30,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {4021#true} call #t~ret8 := main(); {4021#true} is VALID [2018-11-14 18:54:30,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {4021#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {4023#(= main_~i~0 0)} is VALID [2018-11-14 18:54:30,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {4023#(= main_~i~0 0)} assume true; {4023#(= main_~i~0 0)} is VALID [2018-11-14 18:54:30,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {4023#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4023#(= main_~i~0 0)} is VALID [2018-11-14 18:54:30,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {4023#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4024#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:30,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {4024#(<= main_~i~0 1)} assume true; {4024#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:30,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {4024#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4024#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:30,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {4024#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4025#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:30,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {4025#(<= main_~i~0 2)} assume true; {4025#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:30,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {4025#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4025#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:30,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {4025#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4026#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:30,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {4026#(<= main_~i~0 3)} assume true; {4026#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:30,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {4026#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4026#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:30,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {4026#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4027#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:30,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {4027#(<= main_~i~0 4)} assume true; {4027#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:30,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {4027#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4027#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:30,422 INFO L273 TraceCheckUtils]: 20: Hoare triple {4027#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4028#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:30,434 INFO L273 TraceCheckUtils]: 21: Hoare triple {4028#(<= main_~i~0 5)} assume true; {4028#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:30,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {4028#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4028#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:30,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {4028#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4029#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:30,456 INFO L273 TraceCheckUtils]: 24: Hoare triple {4029#(<= main_~i~0 6)} assume true; {4029#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:30,459 INFO L273 TraceCheckUtils]: 25: Hoare triple {4029#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4029#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:30,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {4029#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4030#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:30,462 INFO L273 TraceCheckUtils]: 27: Hoare triple {4030#(<= main_~i~0 7)} assume true; {4030#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:30,462 INFO L273 TraceCheckUtils]: 28: Hoare triple {4030#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4030#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:30,465 INFO L273 TraceCheckUtils]: 29: Hoare triple {4030#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4031#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:30,465 INFO L273 TraceCheckUtils]: 30: Hoare triple {4031#(<= main_~i~0 8)} assume true; {4031#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:30,465 INFO L273 TraceCheckUtils]: 31: Hoare triple {4031#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4031#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:30,466 INFO L273 TraceCheckUtils]: 32: Hoare triple {4031#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4032#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:30,466 INFO L273 TraceCheckUtils]: 33: Hoare triple {4032#(<= main_~i~0 9)} assume true; {4032#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:30,466 INFO L273 TraceCheckUtils]: 34: Hoare triple {4032#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4032#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:30,467 INFO L273 TraceCheckUtils]: 35: Hoare triple {4032#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4033#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:30,467 INFO L273 TraceCheckUtils]: 36: Hoare triple {4033#(<= main_~i~0 10)} assume true; {4033#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:30,468 INFO L273 TraceCheckUtils]: 37: Hoare triple {4033#(<= main_~i~0 10)} assume !(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,468 INFO L273 TraceCheckUtils]: 38: Hoare triple {4022#false} ~i~0 := 0; {4022#false} is VALID [2018-11-14 18:54:30,468 INFO L273 TraceCheckUtils]: 39: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,468 INFO L273 TraceCheckUtils]: 40: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,468 INFO L273 TraceCheckUtils]: 41: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,468 INFO L273 TraceCheckUtils]: 42: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,468 INFO L273 TraceCheckUtils]: 43: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,468 INFO L273 TraceCheckUtils]: 44: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,469 INFO L273 TraceCheckUtils]: 45: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,469 INFO L273 TraceCheckUtils]: 46: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,469 INFO L273 TraceCheckUtils]: 47: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,469 INFO L273 TraceCheckUtils]: 48: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,469 INFO L273 TraceCheckUtils]: 49: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,469 INFO L273 TraceCheckUtils]: 50: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,469 INFO L273 TraceCheckUtils]: 51: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,469 INFO L273 TraceCheckUtils]: 52: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,470 INFO L273 TraceCheckUtils]: 53: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,470 INFO L273 TraceCheckUtils]: 54: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,470 INFO L273 TraceCheckUtils]: 55: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,470 INFO L273 TraceCheckUtils]: 56: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,470 INFO L273 TraceCheckUtils]: 57: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,470 INFO L273 TraceCheckUtils]: 58: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,470 INFO L273 TraceCheckUtils]: 59: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,471 INFO L273 TraceCheckUtils]: 60: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,471 INFO L273 TraceCheckUtils]: 61: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,471 INFO L273 TraceCheckUtils]: 62: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,471 INFO L273 TraceCheckUtils]: 63: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,471 INFO L273 TraceCheckUtils]: 64: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,472 INFO L273 TraceCheckUtils]: 65: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,472 INFO L273 TraceCheckUtils]: 66: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,472 INFO L273 TraceCheckUtils]: 67: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,472 INFO L273 TraceCheckUtils]: 68: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,472 INFO L273 TraceCheckUtils]: 69: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,473 INFO L273 TraceCheckUtils]: 70: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,473 INFO L273 TraceCheckUtils]: 71: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,473 INFO L273 TraceCheckUtils]: 72: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,473 INFO L273 TraceCheckUtils]: 73: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,473 INFO L273 TraceCheckUtils]: 74: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,473 INFO L273 TraceCheckUtils]: 75: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,474 INFO L273 TraceCheckUtils]: 76: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,474 INFO L273 TraceCheckUtils]: 77: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,474 INFO L273 TraceCheckUtils]: 78: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,474 INFO L273 TraceCheckUtils]: 79: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,474 INFO L273 TraceCheckUtils]: 80: Hoare triple {4022#false} assume !(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,474 INFO L273 TraceCheckUtils]: 81: Hoare triple {4022#false} havoc ~x~0;~x~0 := 0; {4022#false} is VALID [2018-11-14 18:54:30,475 INFO L273 TraceCheckUtils]: 82: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,475 INFO L273 TraceCheckUtils]: 83: Hoare triple {4022#false} assume !!(~x~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,475 INFO L273 TraceCheckUtils]: 84: Hoare triple {4022#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {4022#false} is VALID [2018-11-14 18:54:30,475 INFO L256 TraceCheckUtils]: 85: Hoare triple {4022#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4022#false} is VALID [2018-11-14 18:54:30,475 INFO L273 TraceCheckUtils]: 86: Hoare triple {4022#false} ~cond := #in~cond; {4022#false} is VALID [2018-11-14 18:54:30,476 INFO L273 TraceCheckUtils]: 87: Hoare triple {4022#false} assume ~cond == 0; {4022#false} is VALID [2018-11-14 18:54:30,476 INFO L273 TraceCheckUtils]: 88: Hoare triple {4022#false} assume !false; {4022#false} is VALID [2018-11-14 18:54:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-14 18:54:30,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:30,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:30,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:54:30,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:54:30,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:30,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:30,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {4021#true} call ULTIMATE.init(); {4021#true} is VALID [2018-11-14 18:54:30,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {4021#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4021#true} is VALID [2018-11-14 18:54:30,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {4021#true} assume true; {4021#true} is VALID [2018-11-14 18:54:30,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4021#true} {4021#true} #76#return; {4021#true} is VALID [2018-11-14 18:54:30,724 INFO L256 TraceCheckUtils]: 4: Hoare triple {4021#true} call #t~ret8 := main(); {4021#true} is VALID [2018-11-14 18:54:30,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {4021#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {4052#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:30,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {4052#(<= main_~i~0 0)} assume true; {4052#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:30,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {4052#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4052#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:30,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {4052#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4024#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:30,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {4024#(<= main_~i~0 1)} assume true; {4024#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:30,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {4024#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4024#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:30,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {4024#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4025#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:30,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {4025#(<= main_~i~0 2)} assume true; {4025#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:30,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {4025#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4025#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:30,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {4025#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4026#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:30,730 INFO L273 TraceCheckUtils]: 15: Hoare triple {4026#(<= main_~i~0 3)} assume true; {4026#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:30,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {4026#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4026#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:30,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {4026#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4027#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:30,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {4027#(<= main_~i~0 4)} assume true; {4027#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:30,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {4027#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4027#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:30,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {4027#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4028#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:30,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {4028#(<= main_~i~0 5)} assume true; {4028#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:30,745 INFO L273 TraceCheckUtils]: 22: Hoare triple {4028#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4028#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:30,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {4028#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4029#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:30,746 INFO L273 TraceCheckUtils]: 24: Hoare triple {4029#(<= main_~i~0 6)} assume true; {4029#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:30,746 INFO L273 TraceCheckUtils]: 25: Hoare triple {4029#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4029#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:30,747 INFO L273 TraceCheckUtils]: 26: Hoare triple {4029#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4030#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:30,747 INFO L273 TraceCheckUtils]: 27: Hoare triple {4030#(<= main_~i~0 7)} assume true; {4030#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:30,748 INFO L273 TraceCheckUtils]: 28: Hoare triple {4030#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4030#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:30,748 INFO L273 TraceCheckUtils]: 29: Hoare triple {4030#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4031#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:30,749 INFO L273 TraceCheckUtils]: 30: Hoare triple {4031#(<= main_~i~0 8)} assume true; {4031#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:30,749 INFO L273 TraceCheckUtils]: 31: Hoare triple {4031#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4031#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:30,750 INFO L273 TraceCheckUtils]: 32: Hoare triple {4031#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4032#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:30,751 INFO L273 TraceCheckUtils]: 33: Hoare triple {4032#(<= main_~i~0 9)} assume true; {4032#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:30,751 INFO L273 TraceCheckUtils]: 34: Hoare triple {4032#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4032#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:30,752 INFO L273 TraceCheckUtils]: 35: Hoare triple {4032#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4033#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:30,753 INFO L273 TraceCheckUtils]: 36: Hoare triple {4033#(<= main_~i~0 10)} assume true; {4033#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:30,753 INFO L273 TraceCheckUtils]: 37: Hoare triple {4033#(<= main_~i~0 10)} assume !(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,754 INFO L273 TraceCheckUtils]: 38: Hoare triple {4022#false} ~i~0 := 0; {4022#false} is VALID [2018-11-14 18:54:30,754 INFO L273 TraceCheckUtils]: 39: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,754 INFO L273 TraceCheckUtils]: 40: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,754 INFO L273 TraceCheckUtils]: 41: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,755 INFO L273 TraceCheckUtils]: 43: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,755 INFO L273 TraceCheckUtils]: 44: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,755 INFO L273 TraceCheckUtils]: 45: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,755 INFO L273 TraceCheckUtils]: 46: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,755 INFO L273 TraceCheckUtils]: 47: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,756 INFO L273 TraceCheckUtils]: 48: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,756 INFO L273 TraceCheckUtils]: 49: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,756 INFO L273 TraceCheckUtils]: 50: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,756 INFO L273 TraceCheckUtils]: 51: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,757 INFO L273 TraceCheckUtils]: 52: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,757 INFO L273 TraceCheckUtils]: 53: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,757 INFO L273 TraceCheckUtils]: 55: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,757 INFO L273 TraceCheckUtils]: 56: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,758 INFO L273 TraceCheckUtils]: 57: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,758 INFO L273 TraceCheckUtils]: 58: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,758 INFO L273 TraceCheckUtils]: 59: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,758 INFO L273 TraceCheckUtils]: 60: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,758 INFO L273 TraceCheckUtils]: 61: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,758 INFO L273 TraceCheckUtils]: 62: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,758 INFO L273 TraceCheckUtils]: 63: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,758 INFO L273 TraceCheckUtils]: 64: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,759 INFO L273 TraceCheckUtils]: 65: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,759 INFO L273 TraceCheckUtils]: 66: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,759 INFO L273 TraceCheckUtils]: 67: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,759 INFO L273 TraceCheckUtils]: 68: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,759 INFO L273 TraceCheckUtils]: 69: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,759 INFO L273 TraceCheckUtils]: 70: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,759 INFO L273 TraceCheckUtils]: 71: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,759 INFO L273 TraceCheckUtils]: 72: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,759 INFO L273 TraceCheckUtils]: 73: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,760 INFO L273 TraceCheckUtils]: 74: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,760 INFO L273 TraceCheckUtils]: 75: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,760 INFO L273 TraceCheckUtils]: 76: Hoare triple {4022#false} assume !!(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,760 INFO L273 TraceCheckUtils]: 77: Hoare triple {4022#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4022#false} is VALID [2018-11-14 18:54:30,760 INFO L273 TraceCheckUtils]: 78: Hoare triple {4022#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4022#false} is VALID [2018-11-14 18:54:30,760 INFO L273 TraceCheckUtils]: 79: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,760 INFO L273 TraceCheckUtils]: 80: Hoare triple {4022#false} assume !(~i~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,760 INFO L273 TraceCheckUtils]: 81: Hoare triple {4022#false} havoc ~x~0;~x~0 := 0; {4022#false} is VALID [2018-11-14 18:54:30,761 INFO L273 TraceCheckUtils]: 82: Hoare triple {4022#false} assume true; {4022#false} is VALID [2018-11-14 18:54:30,761 INFO L273 TraceCheckUtils]: 83: Hoare triple {4022#false} assume !!(~x~0 < 200000); {4022#false} is VALID [2018-11-14 18:54:30,761 INFO L273 TraceCheckUtils]: 84: Hoare triple {4022#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {4022#false} is VALID [2018-11-14 18:54:30,761 INFO L256 TraceCheckUtils]: 85: Hoare triple {4022#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4022#false} is VALID [2018-11-14 18:54:30,761 INFO L273 TraceCheckUtils]: 86: Hoare triple {4022#false} ~cond := #in~cond; {4022#false} is VALID [2018-11-14 18:54:30,761 INFO L273 TraceCheckUtils]: 87: Hoare triple {4022#false} assume ~cond == 0; {4022#false} is VALID [2018-11-14 18:54:30,761 INFO L273 TraceCheckUtils]: 88: Hoare triple {4022#false} assume !false; {4022#false} is VALID [2018-11-14 18:54:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-14 18:54:30,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:30,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 18:54:30,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-11-14 18:54:30,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:30,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:54:30,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:30,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:54:30,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:54:30,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:54:30,846 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand 14 states. [2018-11-14 18:54:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:31,333 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2018-11-14 18:54:31,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:54:31,333 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-11-14 18:54:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:54:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 142 transitions. [2018-11-14 18:54:31,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:54:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 142 transitions. [2018-11-14 18:54:31,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 142 transitions. [2018-11-14 18:54:32,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:32,012 INFO L225 Difference]: With dead ends: 160 [2018-11-14 18:54:32,013 INFO L226 Difference]: Without dead ends: 104 [2018-11-14 18:54:32,014 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:54:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-14 18:54:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-11-14 18:54:32,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:32,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 101 states. [2018-11-14 18:54:32,454 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 101 states. [2018-11-14 18:54:32,454 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 101 states. [2018-11-14 18:54:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:32,457 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-11-14 18:54:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2018-11-14 18:54:32,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:32,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:32,458 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 104 states. [2018-11-14 18:54:32,458 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 104 states. [2018-11-14 18:54:32,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:32,460 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-11-14 18:54:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2018-11-14 18:54:32,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:32,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:32,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:32,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 18:54:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-11-14 18:54:32,464 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 89 [2018-11-14 18:54:32,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:32,464 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-11-14 18:54:32,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:54:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-11-14 18:54:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-14 18:54:32,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:32,466 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:32,466 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:32,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:32,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1124381537, now seen corresponding path program 9 times [2018-11-14 18:54:32,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:32,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:32,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:32,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:32,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:33,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {4846#true} call ULTIMATE.init(); {4846#true} is VALID [2018-11-14 18:54:33,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {4846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4846#true} is VALID [2018-11-14 18:54:33,318 INFO L273 TraceCheckUtils]: 2: Hoare triple {4846#true} assume true; {4846#true} is VALID [2018-11-14 18:54:33,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4846#true} {4846#true} #76#return; {4846#true} is VALID [2018-11-14 18:54:33,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {4846#true} call #t~ret8 := main(); {4846#true} is VALID [2018-11-14 18:54:33,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {4846#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {4848#(= main_~i~0 0)} is VALID [2018-11-14 18:54:33,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {4848#(= main_~i~0 0)} assume true; {4848#(= main_~i~0 0)} is VALID [2018-11-14 18:54:33,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {4848#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4848#(= main_~i~0 0)} is VALID [2018-11-14 18:54:33,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {4848#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4849#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:33,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {4849#(<= main_~i~0 1)} assume true; {4849#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:33,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {4849#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4849#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:33,349 INFO L273 TraceCheckUtils]: 11: Hoare triple {4849#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4850#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:33,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {4850#(<= main_~i~0 2)} assume true; {4850#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:33,365 INFO L273 TraceCheckUtils]: 13: Hoare triple {4850#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4850#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:33,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {4850#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4851#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:33,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {4851#(<= main_~i~0 3)} assume true; {4851#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:33,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {4851#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4851#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:33,401 INFO L273 TraceCheckUtils]: 17: Hoare triple {4851#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4852#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:33,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {4852#(<= main_~i~0 4)} assume true; {4852#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:33,402 INFO L273 TraceCheckUtils]: 19: Hoare triple {4852#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4852#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:33,402 INFO L273 TraceCheckUtils]: 20: Hoare triple {4852#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4853#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:33,403 INFO L273 TraceCheckUtils]: 21: Hoare triple {4853#(<= main_~i~0 5)} assume true; {4853#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:33,403 INFO L273 TraceCheckUtils]: 22: Hoare triple {4853#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4853#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:33,404 INFO L273 TraceCheckUtils]: 23: Hoare triple {4853#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4854#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:33,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {4854#(<= main_~i~0 6)} assume true; {4854#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:33,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {4854#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4854#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:33,406 INFO L273 TraceCheckUtils]: 26: Hoare triple {4854#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4855#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:33,407 INFO L273 TraceCheckUtils]: 27: Hoare triple {4855#(<= main_~i~0 7)} assume true; {4855#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:33,408 INFO L273 TraceCheckUtils]: 28: Hoare triple {4855#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4855#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:33,409 INFO L273 TraceCheckUtils]: 29: Hoare triple {4855#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4856#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:33,409 INFO L273 TraceCheckUtils]: 30: Hoare triple {4856#(<= main_~i~0 8)} assume true; {4856#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:33,410 INFO L273 TraceCheckUtils]: 31: Hoare triple {4856#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4856#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:33,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {4856#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4857#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:33,412 INFO L273 TraceCheckUtils]: 33: Hoare triple {4857#(<= main_~i~0 9)} assume true; {4857#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:33,412 INFO L273 TraceCheckUtils]: 34: Hoare triple {4857#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4857#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:33,413 INFO L273 TraceCheckUtils]: 35: Hoare triple {4857#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4858#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:33,414 INFO L273 TraceCheckUtils]: 36: Hoare triple {4858#(<= main_~i~0 10)} assume true; {4858#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:33,414 INFO L273 TraceCheckUtils]: 37: Hoare triple {4858#(<= main_~i~0 10)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4858#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:33,415 INFO L273 TraceCheckUtils]: 38: Hoare triple {4858#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4859#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:33,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {4859#(<= main_~i~0 11)} assume true; {4859#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:33,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {4859#(<= main_~i~0 11)} assume !(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,417 INFO L273 TraceCheckUtils]: 41: Hoare triple {4847#false} ~i~0 := 0; {4847#false} is VALID [2018-11-14 18:54:33,417 INFO L273 TraceCheckUtils]: 42: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,418 INFO L273 TraceCheckUtils]: 43: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,418 INFO L273 TraceCheckUtils]: 44: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:33,418 INFO L273 TraceCheckUtils]: 45: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:33,418 INFO L273 TraceCheckUtils]: 46: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,419 INFO L273 TraceCheckUtils]: 47: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,419 INFO L273 TraceCheckUtils]: 48: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:33,419 INFO L273 TraceCheckUtils]: 49: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:33,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,420 INFO L273 TraceCheckUtils]: 51: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:33,420 INFO L273 TraceCheckUtils]: 53: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:33,420 INFO L273 TraceCheckUtils]: 54: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,420 INFO L273 TraceCheckUtils]: 55: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,420 INFO L273 TraceCheckUtils]: 56: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:33,420 INFO L273 TraceCheckUtils]: 57: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:33,421 INFO L273 TraceCheckUtils]: 58: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,421 INFO L273 TraceCheckUtils]: 59: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,421 INFO L273 TraceCheckUtils]: 60: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:33,421 INFO L273 TraceCheckUtils]: 61: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:33,421 INFO L273 TraceCheckUtils]: 62: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,421 INFO L273 TraceCheckUtils]: 63: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,422 INFO L273 TraceCheckUtils]: 64: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:33,422 INFO L273 TraceCheckUtils]: 65: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:33,422 INFO L273 TraceCheckUtils]: 66: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,422 INFO L273 TraceCheckUtils]: 67: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,422 INFO L273 TraceCheckUtils]: 68: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:33,422 INFO L273 TraceCheckUtils]: 69: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:33,422 INFO L273 TraceCheckUtils]: 70: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,423 INFO L273 TraceCheckUtils]: 71: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,423 INFO L273 TraceCheckUtils]: 72: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:33,423 INFO L273 TraceCheckUtils]: 73: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:33,423 INFO L273 TraceCheckUtils]: 74: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,423 INFO L273 TraceCheckUtils]: 75: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,423 INFO L273 TraceCheckUtils]: 76: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:33,424 INFO L273 TraceCheckUtils]: 77: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:33,424 INFO L273 TraceCheckUtils]: 78: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,424 INFO L273 TraceCheckUtils]: 79: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,424 INFO L273 TraceCheckUtils]: 80: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:33,424 INFO L273 TraceCheckUtils]: 81: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:33,424 INFO L273 TraceCheckUtils]: 82: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,424 INFO L273 TraceCheckUtils]: 83: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,425 INFO L273 TraceCheckUtils]: 84: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:33,425 INFO L273 TraceCheckUtils]: 85: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:33,425 INFO L273 TraceCheckUtils]: 86: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,425 INFO L273 TraceCheckUtils]: 87: Hoare triple {4847#false} assume !(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,425 INFO L273 TraceCheckUtils]: 88: Hoare triple {4847#false} havoc ~x~0;~x~0 := 0; {4847#false} is VALID [2018-11-14 18:54:33,425 INFO L273 TraceCheckUtils]: 89: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:33,426 INFO L273 TraceCheckUtils]: 90: Hoare triple {4847#false} assume !!(~x~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:33,426 INFO L273 TraceCheckUtils]: 91: Hoare triple {4847#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {4847#false} is VALID [2018-11-14 18:54:33,426 INFO L256 TraceCheckUtils]: 92: Hoare triple {4847#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4847#false} is VALID [2018-11-14 18:54:33,426 INFO L273 TraceCheckUtils]: 93: Hoare triple {4847#false} ~cond := #in~cond; {4847#false} is VALID [2018-11-14 18:54:33,426 INFO L273 TraceCheckUtils]: 94: Hoare triple {4847#false} assume ~cond == 0; {4847#false} is VALID [2018-11-14 18:54:33,426 INFO L273 TraceCheckUtils]: 95: Hoare triple {4847#false} assume !false; {4847#false} is VALID [2018-11-14 18:54:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-14 18:54:33,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:33,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:33,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:54:43,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-14 18:54:43,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:43,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:44,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {4846#true} call ULTIMATE.init(); {4846#true} is VALID [2018-11-14 18:54:44,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {4846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4846#true} is VALID [2018-11-14 18:54:44,160 INFO L273 TraceCheckUtils]: 2: Hoare triple {4846#true} assume true; {4846#true} is VALID [2018-11-14 18:54:44,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4846#true} {4846#true} #76#return; {4846#true} is VALID [2018-11-14 18:54:44,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {4846#true} call #t~ret8 := main(); {4846#true} is VALID [2018-11-14 18:54:44,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {4846#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {4878#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:44,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {4878#(<= main_~i~0 0)} assume true; {4878#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:44,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {4878#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4878#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:44,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {4878#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4849#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:44,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {4849#(<= main_~i~0 1)} assume true; {4849#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:44,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {4849#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4849#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:44,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {4849#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4850#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:44,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {4850#(<= main_~i~0 2)} assume true; {4850#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:44,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {4850#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4850#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:44,166 INFO L273 TraceCheckUtils]: 14: Hoare triple {4850#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4851#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:44,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {4851#(<= main_~i~0 3)} assume true; {4851#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:44,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {4851#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4851#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:44,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {4851#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4852#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:44,169 INFO L273 TraceCheckUtils]: 18: Hoare triple {4852#(<= main_~i~0 4)} assume true; {4852#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:44,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {4852#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4852#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:44,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {4852#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4853#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:44,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {4853#(<= main_~i~0 5)} assume true; {4853#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:44,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {4853#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4853#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:44,172 INFO L273 TraceCheckUtils]: 23: Hoare triple {4853#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4854#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:44,173 INFO L273 TraceCheckUtils]: 24: Hoare triple {4854#(<= main_~i~0 6)} assume true; {4854#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:44,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {4854#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4854#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:44,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {4854#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4855#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:44,175 INFO L273 TraceCheckUtils]: 27: Hoare triple {4855#(<= main_~i~0 7)} assume true; {4855#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:44,175 INFO L273 TraceCheckUtils]: 28: Hoare triple {4855#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4855#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:44,176 INFO L273 TraceCheckUtils]: 29: Hoare triple {4855#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4856#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:44,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {4856#(<= main_~i~0 8)} assume true; {4856#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:44,177 INFO L273 TraceCheckUtils]: 31: Hoare triple {4856#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4856#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:44,178 INFO L273 TraceCheckUtils]: 32: Hoare triple {4856#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4857#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:44,178 INFO L273 TraceCheckUtils]: 33: Hoare triple {4857#(<= main_~i~0 9)} assume true; {4857#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:44,179 INFO L273 TraceCheckUtils]: 34: Hoare triple {4857#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4857#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:44,180 INFO L273 TraceCheckUtils]: 35: Hoare triple {4857#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4858#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:44,180 INFO L273 TraceCheckUtils]: 36: Hoare triple {4858#(<= main_~i~0 10)} assume true; {4858#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:44,181 INFO L273 TraceCheckUtils]: 37: Hoare triple {4858#(<= main_~i~0 10)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {4858#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:44,181 INFO L273 TraceCheckUtils]: 38: Hoare triple {4858#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4859#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:44,182 INFO L273 TraceCheckUtils]: 39: Hoare triple {4859#(<= main_~i~0 11)} assume true; {4859#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:44,183 INFO L273 TraceCheckUtils]: 40: Hoare triple {4859#(<= main_~i~0 11)} assume !(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,183 INFO L273 TraceCheckUtils]: 41: Hoare triple {4847#false} ~i~0 := 0; {4847#false} is VALID [2018-11-14 18:54:44,183 INFO L273 TraceCheckUtils]: 42: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,183 INFO L273 TraceCheckUtils]: 43: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,183 INFO L273 TraceCheckUtils]: 44: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:44,184 INFO L273 TraceCheckUtils]: 45: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:44,184 INFO L273 TraceCheckUtils]: 46: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,184 INFO L273 TraceCheckUtils]: 47: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,184 INFO L273 TraceCheckUtils]: 48: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:44,185 INFO L273 TraceCheckUtils]: 49: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:44,185 INFO L273 TraceCheckUtils]: 50: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,185 INFO L273 TraceCheckUtils]: 51: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,185 INFO L273 TraceCheckUtils]: 52: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:44,185 INFO L273 TraceCheckUtils]: 53: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:44,186 INFO L273 TraceCheckUtils]: 54: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,186 INFO L273 TraceCheckUtils]: 55: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,186 INFO L273 TraceCheckUtils]: 56: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:44,186 INFO L273 TraceCheckUtils]: 57: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:44,186 INFO L273 TraceCheckUtils]: 58: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,186 INFO L273 TraceCheckUtils]: 59: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,186 INFO L273 TraceCheckUtils]: 60: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:44,187 INFO L273 TraceCheckUtils]: 61: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:44,187 INFO L273 TraceCheckUtils]: 62: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,187 INFO L273 TraceCheckUtils]: 63: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,187 INFO L273 TraceCheckUtils]: 64: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:44,187 INFO L273 TraceCheckUtils]: 65: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:44,187 INFO L273 TraceCheckUtils]: 66: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,187 INFO L273 TraceCheckUtils]: 67: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,187 INFO L273 TraceCheckUtils]: 68: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:44,188 INFO L273 TraceCheckUtils]: 69: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:44,188 INFO L273 TraceCheckUtils]: 70: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,188 INFO L273 TraceCheckUtils]: 71: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,188 INFO L273 TraceCheckUtils]: 72: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:44,188 INFO L273 TraceCheckUtils]: 73: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:44,188 INFO L273 TraceCheckUtils]: 74: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,188 INFO L273 TraceCheckUtils]: 75: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,189 INFO L273 TraceCheckUtils]: 76: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:44,189 INFO L273 TraceCheckUtils]: 77: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:44,189 INFO L273 TraceCheckUtils]: 78: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,189 INFO L273 TraceCheckUtils]: 79: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,189 INFO L273 TraceCheckUtils]: 80: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:44,189 INFO L273 TraceCheckUtils]: 81: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:44,189 INFO L273 TraceCheckUtils]: 82: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,190 INFO L273 TraceCheckUtils]: 83: Hoare triple {4847#false} assume !!(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,190 INFO L273 TraceCheckUtils]: 84: Hoare triple {4847#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4847#false} is VALID [2018-11-14 18:54:44,190 INFO L273 TraceCheckUtils]: 85: Hoare triple {4847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4847#false} is VALID [2018-11-14 18:54:44,190 INFO L273 TraceCheckUtils]: 86: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,190 INFO L273 TraceCheckUtils]: 87: Hoare triple {4847#false} assume !(~i~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,191 INFO L273 TraceCheckUtils]: 88: Hoare triple {4847#false} havoc ~x~0;~x~0 := 0; {4847#false} is VALID [2018-11-14 18:54:44,191 INFO L273 TraceCheckUtils]: 89: Hoare triple {4847#false} assume true; {4847#false} is VALID [2018-11-14 18:54:44,191 INFO L273 TraceCheckUtils]: 90: Hoare triple {4847#false} assume !!(~x~0 < 200000); {4847#false} is VALID [2018-11-14 18:54:44,191 INFO L273 TraceCheckUtils]: 91: Hoare triple {4847#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {4847#false} is VALID [2018-11-14 18:54:44,191 INFO L256 TraceCheckUtils]: 92: Hoare triple {4847#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4847#false} is VALID [2018-11-14 18:54:44,192 INFO L273 TraceCheckUtils]: 93: Hoare triple {4847#false} ~cond := #in~cond; {4847#false} is VALID [2018-11-14 18:54:44,192 INFO L273 TraceCheckUtils]: 94: Hoare triple {4847#false} assume ~cond == 0; {4847#false} is VALID [2018-11-14 18:54:44,192 INFO L273 TraceCheckUtils]: 95: Hoare triple {4847#false} assume !false; {4847#false} is VALID [2018-11-14 18:54:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-14 18:54:44,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:44,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 18:54:44,232 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2018-11-14 18:54:44,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:44,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 18:54:44,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:44,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 18:54:44,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 18:54:44,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:54:44,293 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 15 states. [2018-11-14 18:54:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:45,072 INFO L93 Difference]: Finished difference Result 171 states and 202 transitions. [2018-11-14 18:54:45,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:54:45,072 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2018-11-14 18:54:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:54:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 150 transitions. [2018-11-14 18:54:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:54:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 150 transitions. [2018-11-14 18:54:45,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 150 transitions. [2018-11-14 18:54:45,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:45,214 INFO L225 Difference]: With dead ends: 171 [2018-11-14 18:54:45,214 INFO L226 Difference]: Without dead ends: 111 [2018-11-14 18:54:45,215 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:54:45,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-14 18:54:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-11-14 18:54:45,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:45,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 108 states. [2018-11-14 18:54:45,406 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 108 states. [2018-11-14 18:54:45,406 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 108 states. [2018-11-14 18:54:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:45,410 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2018-11-14 18:54:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2018-11-14 18:54:45,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:45,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:45,410 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 111 states. [2018-11-14 18:54:45,411 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 111 states. [2018-11-14 18:54:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:45,413 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2018-11-14 18:54:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2018-11-14 18:54:45,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:45,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:45,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:45,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-14 18:54:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-11-14 18:54:45,416 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 96 [2018-11-14 18:54:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:45,417 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-11-14 18:54:45,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 18:54:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-11-14 18:54:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-14 18:54:45,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:45,418 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:45,418 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:45,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:45,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2034586719, now seen corresponding path program 10 times [2018-11-14 18:54:45,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:45,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:45,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:45,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:45,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:46,107 INFO L256 TraceCheckUtils]: 0: Hoare triple {5730#true} call ULTIMATE.init(); {5730#true} is VALID [2018-11-14 18:54:46,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {5730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5730#true} is VALID [2018-11-14 18:54:46,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {5730#true} assume true; {5730#true} is VALID [2018-11-14 18:54:46,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5730#true} {5730#true} #76#return; {5730#true} is VALID [2018-11-14 18:54:46,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {5730#true} call #t~ret8 := main(); {5730#true} is VALID [2018-11-14 18:54:46,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {5730#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {5732#(= main_~i~0 0)} is VALID [2018-11-14 18:54:46,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {5732#(= main_~i~0 0)} assume true; {5732#(= main_~i~0 0)} is VALID [2018-11-14 18:54:46,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {5732#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5732#(= main_~i~0 0)} is VALID [2018-11-14 18:54:46,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {5732#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5733#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:46,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {5733#(<= main_~i~0 1)} assume true; {5733#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:46,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {5733#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5733#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:46,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {5733#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5734#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:46,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {5734#(<= main_~i~0 2)} assume true; {5734#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:46,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {5734#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5734#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:46,112 INFO L273 TraceCheckUtils]: 14: Hoare triple {5734#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5735#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:46,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {5735#(<= main_~i~0 3)} assume true; {5735#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:46,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {5735#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5735#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:46,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {5735#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5736#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:46,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {5736#(<= main_~i~0 4)} assume true; {5736#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:46,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {5736#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5736#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:46,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {5736#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5737#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:46,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {5737#(<= main_~i~0 5)} assume true; {5737#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:46,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {5737#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5737#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:46,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {5737#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5738#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:46,118 INFO L273 TraceCheckUtils]: 24: Hoare triple {5738#(<= main_~i~0 6)} assume true; {5738#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:46,118 INFO L273 TraceCheckUtils]: 25: Hoare triple {5738#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5738#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:46,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {5738#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5739#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:46,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {5739#(<= main_~i~0 7)} assume true; {5739#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:46,120 INFO L273 TraceCheckUtils]: 28: Hoare triple {5739#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5739#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:46,120 INFO L273 TraceCheckUtils]: 29: Hoare triple {5739#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5740#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:46,121 INFO L273 TraceCheckUtils]: 30: Hoare triple {5740#(<= main_~i~0 8)} assume true; {5740#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:46,121 INFO L273 TraceCheckUtils]: 31: Hoare triple {5740#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5740#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:46,122 INFO L273 TraceCheckUtils]: 32: Hoare triple {5740#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5741#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:46,123 INFO L273 TraceCheckUtils]: 33: Hoare triple {5741#(<= main_~i~0 9)} assume true; {5741#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:46,123 INFO L273 TraceCheckUtils]: 34: Hoare triple {5741#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5741#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:46,124 INFO L273 TraceCheckUtils]: 35: Hoare triple {5741#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5742#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:46,124 INFO L273 TraceCheckUtils]: 36: Hoare triple {5742#(<= main_~i~0 10)} assume true; {5742#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:46,125 INFO L273 TraceCheckUtils]: 37: Hoare triple {5742#(<= main_~i~0 10)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5742#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:46,126 INFO L273 TraceCheckUtils]: 38: Hoare triple {5742#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5743#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:46,126 INFO L273 TraceCheckUtils]: 39: Hoare triple {5743#(<= main_~i~0 11)} assume true; {5743#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:46,127 INFO L273 TraceCheckUtils]: 40: Hoare triple {5743#(<= main_~i~0 11)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5743#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:46,127 INFO L273 TraceCheckUtils]: 41: Hoare triple {5743#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5744#(<= main_~i~0 12)} is VALID [2018-11-14 18:54:46,128 INFO L273 TraceCheckUtils]: 42: Hoare triple {5744#(<= main_~i~0 12)} assume true; {5744#(<= main_~i~0 12)} is VALID [2018-11-14 18:54:46,128 INFO L273 TraceCheckUtils]: 43: Hoare triple {5744#(<= main_~i~0 12)} assume !(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,129 INFO L273 TraceCheckUtils]: 44: Hoare triple {5731#false} ~i~0 := 0; {5731#false} is VALID [2018-11-14 18:54:46,129 INFO L273 TraceCheckUtils]: 45: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,129 INFO L273 TraceCheckUtils]: 46: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,129 INFO L273 TraceCheckUtils]: 47: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,129 INFO L273 TraceCheckUtils]: 48: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,130 INFO L273 TraceCheckUtils]: 49: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,130 INFO L273 TraceCheckUtils]: 50: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,130 INFO L273 TraceCheckUtils]: 51: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,130 INFO L273 TraceCheckUtils]: 52: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,130 INFO L273 TraceCheckUtils]: 53: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,131 INFO L273 TraceCheckUtils]: 54: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,131 INFO L273 TraceCheckUtils]: 55: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,131 INFO L273 TraceCheckUtils]: 56: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,131 INFO L273 TraceCheckUtils]: 57: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,131 INFO L273 TraceCheckUtils]: 58: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,132 INFO L273 TraceCheckUtils]: 59: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,132 INFO L273 TraceCheckUtils]: 60: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,132 INFO L273 TraceCheckUtils]: 61: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,132 INFO L273 TraceCheckUtils]: 62: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,132 INFO L273 TraceCheckUtils]: 63: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,133 INFO L273 TraceCheckUtils]: 64: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,133 INFO L273 TraceCheckUtils]: 65: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,133 INFO L273 TraceCheckUtils]: 66: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,133 INFO L273 TraceCheckUtils]: 67: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,133 INFO L273 TraceCheckUtils]: 68: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,133 INFO L273 TraceCheckUtils]: 69: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,134 INFO L273 TraceCheckUtils]: 70: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,134 INFO L273 TraceCheckUtils]: 71: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,134 INFO L273 TraceCheckUtils]: 72: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,134 INFO L273 TraceCheckUtils]: 73: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,134 INFO L273 TraceCheckUtils]: 74: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,134 INFO L273 TraceCheckUtils]: 75: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,134 INFO L273 TraceCheckUtils]: 76: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,134 INFO L273 TraceCheckUtils]: 77: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,134 INFO L273 TraceCheckUtils]: 78: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,135 INFO L273 TraceCheckUtils]: 79: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,135 INFO L273 TraceCheckUtils]: 80: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,135 INFO L273 TraceCheckUtils]: 81: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,135 INFO L273 TraceCheckUtils]: 82: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,135 INFO L273 TraceCheckUtils]: 83: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,135 INFO L273 TraceCheckUtils]: 84: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,135 INFO L273 TraceCheckUtils]: 85: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,135 INFO L273 TraceCheckUtils]: 86: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,136 INFO L273 TraceCheckUtils]: 87: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,136 INFO L273 TraceCheckUtils]: 88: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,136 INFO L273 TraceCheckUtils]: 89: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,136 INFO L273 TraceCheckUtils]: 90: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,136 INFO L273 TraceCheckUtils]: 91: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,136 INFO L273 TraceCheckUtils]: 92: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,136 INFO L273 TraceCheckUtils]: 93: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,136 INFO L273 TraceCheckUtils]: 94: Hoare triple {5731#false} assume !(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,137 INFO L273 TraceCheckUtils]: 95: Hoare triple {5731#false} havoc ~x~0;~x~0 := 0; {5731#false} is VALID [2018-11-14 18:54:46,137 INFO L273 TraceCheckUtils]: 96: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,137 INFO L273 TraceCheckUtils]: 97: Hoare triple {5731#false} assume !!(~x~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,137 INFO L273 TraceCheckUtils]: 98: Hoare triple {5731#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {5731#false} is VALID [2018-11-14 18:54:46,137 INFO L256 TraceCheckUtils]: 99: Hoare triple {5731#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5731#false} is VALID [2018-11-14 18:54:46,137 INFO L273 TraceCheckUtils]: 100: Hoare triple {5731#false} ~cond := #in~cond; {5731#false} is VALID [2018-11-14 18:54:46,137 INFO L273 TraceCheckUtils]: 101: Hoare triple {5731#false} assume ~cond == 0; {5731#false} is VALID [2018-11-14 18:54:46,137 INFO L273 TraceCheckUtils]: 102: Hoare triple {5731#false} assume !false; {5731#false} is VALID [2018-11-14 18:54:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-14 18:54:46,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:46,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:46,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:54:46,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:54:46,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:54:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:46,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:46,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {5730#true} call ULTIMATE.init(); {5730#true} is VALID [2018-11-14 18:54:46,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {5730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5730#true} is VALID [2018-11-14 18:54:46,400 INFO L273 TraceCheckUtils]: 2: Hoare triple {5730#true} assume true; {5730#true} is VALID [2018-11-14 18:54:46,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5730#true} {5730#true} #76#return; {5730#true} is VALID [2018-11-14 18:54:46,401 INFO L256 TraceCheckUtils]: 4: Hoare triple {5730#true} call #t~ret8 := main(); {5730#true} is VALID [2018-11-14 18:54:46,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {5730#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {5763#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:46,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {5763#(<= main_~i~0 0)} assume true; {5763#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:46,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {5763#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5763#(<= main_~i~0 0)} is VALID [2018-11-14 18:54:46,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {5763#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5733#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:46,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {5733#(<= main_~i~0 1)} assume true; {5733#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:46,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {5733#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5733#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:46,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {5733#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5734#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:46,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {5734#(<= main_~i~0 2)} assume true; {5734#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:46,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {5734#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5734#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:46,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {5734#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5735#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:46,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {5735#(<= main_~i~0 3)} assume true; {5735#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:46,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {5735#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5735#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:46,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {5735#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5736#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:46,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {5736#(<= main_~i~0 4)} assume true; {5736#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:46,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {5736#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5736#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:46,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {5736#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5737#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:46,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {5737#(<= main_~i~0 5)} assume true; {5737#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:46,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {5737#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5737#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:46,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {5737#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5738#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:46,411 INFO L273 TraceCheckUtils]: 24: Hoare triple {5738#(<= main_~i~0 6)} assume true; {5738#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:46,411 INFO L273 TraceCheckUtils]: 25: Hoare triple {5738#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5738#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:46,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {5738#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5739#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:46,412 INFO L273 TraceCheckUtils]: 27: Hoare triple {5739#(<= main_~i~0 7)} assume true; {5739#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:46,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {5739#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5739#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:46,413 INFO L273 TraceCheckUtils]: 29: Hoare triple {5739#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5740#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:46,414 INFO L273 TraceCheckUtils]: 30: Hoare triple {5740#(<= main_~i~0 8)} assume true; {5740#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:46,414 INFO L273 TraceCheckUtils]: 31: Hoare triple {5740#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5740#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:46,415 INFO L273 TraceCheckUtils]: 32: Hoare triple {5740#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5741#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:46,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {5741#(<= main_~i~0 9)} assume true; {5741#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:46,416 INFO L273 TraceCheckUtils]: 34: Hoare triple {5741#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5741#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:46,417 INFO L273 TraceCheckUtils]: 35: Hoare triple {5741#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5742#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:46,417 INFO L273 TraceCheckUtils]: 36: Hoare triple {5742#(<= main_~i~0 10)} assume true; {5742#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:46,418 INFO L273 TraceCheckUtils]: 37: Hoare triple {5742#(<= main_~i~0 10)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5742#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:46,419 INFO L273 TraceCheckUtils]: 38: Hoare triple {5742#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5743#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:46,419 INFO L273 TraceCheckUtils]: 39: Hoare triple {5743#(<= main_~i~0 11)} assume true; {5743#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:46,420 INFO L273 TraceCheckUtils]: 40: Hoare triple {5743#(<= main_~i~0 11)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {5743#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:46,420 INFO L273 TraceCheckUtils]: 41: Hoare triple {5743#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5744#(<= main_~i~0 12)} is VALID [2018-11-14 18:54:46,421 INFO L273 TraceCheckUtils]: 42: Hoare triple {5744#(<= main_~i~0 12)} assume true; {5744#(<= main_~i~0 12)} is VALID [2018-11-14 18:54:46,421 INFO L273 TraceCheckUtils]: 43: Hoare triple {5744#(<= main_~i~0 12)} assume !(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,422 INFO L273 TraceCheckUtils]: 44: Hoare triple {5731#false} ~i~0 := 0; {5731#false} is VALID [2018-11-14 18:54:46,422 INFO L273 TraceCheckUtils]: 45: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,422 INFO L273 TraceCheckUtils]: 46: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,422 INFO L273 TraceCheckUtils]: 47: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,422 INFO L273 TraceCheckUtils]: 48: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,423 INFO L273 TraceCheckUtils]: 49: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,423 INFO L273 TraceCheckUtils]: 50: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,423 INFO L273 TraceCheckUtils]: 51: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,423 INFO L273 TraceCheckUtils]: 52: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,423 INFO L273 TraceCheckUtils]: 53: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,424 INFO L273 TraceCheckUtils]: 54: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,424 INFO L273 TraceCheckUtils]: 55: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,424 INFO L273 TraceCheckUtils]: 56: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,424 INFO L273 TraceCheckUtils]: 57: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,424 INFO L273 TraceCheckUtils]: 58: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,424 INFO L273 TraceCheckUtils]: 59: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,425 INFO L273 TraceCheckUtils]: 60: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,425 INFO L273 TraceCheckUtils]: 61: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,425 INFO L273 TraceCheckUtils]: 62: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,425 INFO L273 TraceCheckUtils]: 63: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,425 INFO L273 TraceCheckUtils]: 64: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,425 INFO L273 TraceCheckUtils]: 65: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,425 INFO L273 TraceCheckUtils]: 66: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,425 INFO L273 TraceCheckUtils]: 67: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,426 INFO L273 TraceCheckUtils]: 68: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,426 INFO L273 TraceCheckUtils]: 69: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,426 INFO L273 TraceCheckUtils]: 70: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,426 INFO L273 TraceCheckUtils]: 71: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,426 INFO L273 TraceCheckUtils]: 72: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,426 INFO L273 TraceCheckUtils]: 73: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,426 INFO L273 TraceCheckUtils]: 74: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,426 INFO L273 TraceCheckUtils]: 75: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,426 INFO L273 TraceCheckUtils]: 76: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,427 INFO L273 TraceCheckUtils]: 77: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,427 INFO L273 TraceCheckUtils]: 78: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,427 INFO L273 TraceCheckUtils]: 79: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,427 INFO L273 TraceCheckUtils]: 80: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,427 INFO L273 TraceCheckUtils]: 81: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,427 INFO L273 TraceCheckUtils]: 82: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,427 INFO L273 TraceCheckUtils]: 83: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,427 INFO L273 TraceCheckUtils]: 84: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,428 INFO L273 TraceCheckUtils]: 85: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,428 INFO L273 TraceCheckUtils]: 86: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,428 INFO L273 TraceCheckUtils]: 87: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,428 INFO L273 TraceCheckUtils]: 88: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,428 INFO L273 TraceCheckUtils]: 89: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,428 INFO L273 TraceCheckUtils]: 90: Hoare triple {5731#false} assume !!(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,428 INFO L273 TraceCheckUtils]: 91: Hoare triple {5731#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5731#false} is VALID [2018-11-14 18:54:46,428 INFO L273 TraceCheckUtils]: 92: Hoare triple {5731#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5731#false} is VALID [2018-11-14 18:54:46,429 INFO L273 TraceCheckUtils]: 93: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,429 INFO L273 TraceCheckUtils]: 94: Hoare triple {5731#false} assume !(~i~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,429 INFO L273 TraceCheckUtils]: 95: Hoare triple {5731#false} havoc ~x~0;~x~0 := 0; {5731#false} is VALID [2018-11-14 18:54:46,429 INFO L273 TraceCheckUtils]: 96: Hoare triple {5731#false} assume true; {5731#false} is VALID [2018-11-14 18:54:46,429 INFO L273 TraceCheckUtils]: 97: Hoare triple {5731#false} assume !!(~x~0 < 200000); {5731#false} is VALID [2018-11-14 18:54:46,429 INFO L273 TraceCheckUtils]: 98: Hoare triple {5731#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {5731#false} is VALID [2018-11-14 18:54:46,429 INFO L256 TraceCheckUtils]: 99: Hoare triple {5731#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5731#false} is VALID [2018-11-14 18:54:46,429 INFO L273 TraceCheckUtils]: 100: Hoare triple {5731#false} ~cond := #in~cond; {5731#false} is VALID [2018-11-14 18:54:46,430 INFO L273 TraceCheckUtils]: 101: Hoare triple {5731#false} assume ~cond == 0; {5731#false} is VALID [2018-11-14 18:54:46,430 INFO L273 TraceCheckUtils]: 102: Hoare triple {5731#false} assume !false; {5731#false} is VALID [2018-11-14 18:54:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-14 18:54:46,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:54:46,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-14 18:54:46,456 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2018-11-14 18:54:46,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:46,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:54:46,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:46,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:54:46,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:54:46,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:54:46,517 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 16 states. [2018-11-14 18:54:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:47,063 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2018-11-14 18:54:47,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 18:54:47,063 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2018-11-14 18:54:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:54:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2018-11-14 18:54:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:54:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2018-11-14 18:54:47,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 158 transitions. [2018-11-14 18:54:47,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:47,686 INFO L225 Difference]: With dead ends: 182 [2018-11-14 18:54:47,686 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 18:54:47,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:54:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 18:54:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2018-11-14 18:54:47,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:47,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 115 states. [2018-11-14 18:54:47,730 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 115 states. [2018-11-14 18:54:47,730 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 115 states. [2018-11-14 18:54:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:47,732 INFO L93 Difference]: Finished difference Result 118 states and 135 transitions. [2018-11-14 18:54:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2018-11-14 18:54:47,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:47,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:47,732 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 118 states. [2018-11-14 18:54:47,733 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 118 states. [2018-11-14 18:54:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:47,735 INFO L93 Difference]: Finished difference Result 118 states and 135 transitions. [2018-11-14 18:54:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2018-11-14 18:54:47,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:47,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:47,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:47,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-14 18:54:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-11-14 18:54:47,739 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 103 [2018-11-14 18:54:47,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:47,739 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-11-14 18:54:47,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:54:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-11-14 18:54:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-14 18:54:47,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:47,740 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:47,741 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:47,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1263741807, now seen corresponding path program 11 times [2018-11-14 18:54:47,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:47,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:47,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:54:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:48,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {6673#true} call ULTIMATE.init(); {6673#true} is VALID [2018-11-14 18:54:48,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {6673#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6673#true} is VALID [2018-11-14 18:54:48,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:54:48,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6673#true} {6673#true} #76#return; {6673#true} is VALID [2018-11-14 18:54:48,379 INFO L256 TraceCheckUtils]: 4: Hoare triple {6673#true} call #t~ret8 := main(); {6673#true} is VALID [2018-11-14 18:54:48,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {6673#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {6675#(= main_~i~0 0)} is VALID [2018-11-14 18:54:48,399 INFO L273 TraceCheckUtils]: 6: Hoare triple {6675#(= main_~i~0 0)} assume true; {6675#(= main_~i~0 0)} is VALID [2018-11-14 18:54:48,400 INFO L273 TraceCheckUtils]: 7: Hoare triple {6675#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6675#(= main_~i~0 0)} is VALID [2018-11-14 18:54:48,400 INFO L273 TraceCheckUtils]: 8: Hoare triple {6675#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6676#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:48,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {6676#(<= main_~i~0 1)} assume true; {6676#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:48,401 INFO L273 TraceCheckUtils]: 10: Hoare triple {6676#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6676#(<= main_~i~0 1)} is VALID [2018-11-14 18:54:48,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {6676#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6677#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:48,402 INFO L273 TraceCheckUtils]: 12: Hoare triple {6677#(<= main_~i~0 2)} assume true; {6677#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:48,403 INFO L273 TraceCheckUtils]: 13: Hoare triple {6677#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6677#(<= main_~i~0 2)} is VALID [2018-11-14 18:54:48,403 INFO L273 TraceCheckUtils]: 14: Hoare triple {6677#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6678#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:48,404 INFO L273 TraceCheckUtils]: 15: Hoare triple {6678#(<= main_~i~0 3)} assume true; {6678#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:48,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {6678#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6678#(<= main_~i~0 3)} is VALID [2018-11-14 18:54:48,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {6678#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6679#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:48,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {6679#(<= main_~i~0 4)} assume true; {6679#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:48,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {6679#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6679#(<= main_~i~0 4)} is VALID [2018-11-14 18:54:48,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {6679#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6680#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:48,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {6680#(<= main_~i~0 5)} assume true; {6680#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:48,408 INFO L273 TraceCheckUtils]: 22: Hoare triple {6680#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6680#(<= main_~i~0 5)} is VALID [2018-11-14 18:54:48,409 INFO L273 TraceCheckUtils]: 23: Hoare triple {6680#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6681#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:48,409 INFO L273 TraceCheckUtils]: 24: Hoare triple {6681#(<= main_~i~0 6)} assume true; {6681#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:48,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {6681#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6681#(<= main_~i~0 6)} is VALID [2018-11-14 18:54:48,411 INFO L273 TraceCheckUtils]: 26: Hoare triple {6681#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6682#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:48,411 INFO L273 TraceCheckUtils]: 27: Hoare triple {6682#(<= main_~i~0 7)} assume true; {6682#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:48,412 INFO L273 TraceCheckUtils]: 28: Hoare triple {6682#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6682#(<= main_~i~0 7)} is VALID [2018-11-14 18:54:48,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {6682#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6683#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:48,413 INFO L273 TraceCheckUtils]: 30: Hoare triple {6683#(<= main_~i~0 8)} assume true; {6683#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:48,414 INFO L273 TraceCheckUtils]: 31: Hoare triple {6683#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6683#(<= main_~i~0 8)} is VALID [2018-11-14 18:54:48,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {6683#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6684#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:48,415 INFO L273 TraceCheckUtils]: 33: Hoare triple {6684#(<= main_~i~0 9)} assume true; {6684#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:48,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {6684#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6684#(<= main_~i~0 9)} is VALID [2018-11-14 18:54:48,416 INFO L273 TraceCheckUtils]: 35: Hoare triple {6684#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6685#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:48,417 INFO L273 TraceCheckUtils]: 36: Hoare triple {6685#(<= main_~i~0 10)} assume true; {6685#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:48,417 INFO L273 TraceCheckUtils]: 37: Hoare triple {6685#(<= main_~i~0 10)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6685#(<= main_~i~0 10)} is VALID [2018-11-14 18:54:48,418 INFO L273 TraceCheckUtils]: 38: Hoare triple {6685#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6686#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:48,418 INFO L273 TraceCheckUtils]: 39: Hoare triple {6686#(<= main_~i~0 11)} assume true; {6686#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:48,419 INFO L273 TraceCheckUtils]: 40: Hoare triple {6686#(<= main_~i~0 11)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6686#(<= main_~i~0 11)} is VALID [2018-11-14 18:54:48,420 INFO L273 TraceCheckUtils]: 41: Hoare triple {6686#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6687#(<= main_~i~0 12)} is VALID [2018-11-14 18:54:48,420 INFO L273 TraceCheckUtils]: 42: Hoare triple {6687#(<= main_~i~0 12)} assume true; {6687#(<= main_~i~0 12)} is VALID [2018-11-14 18:54:48,421 INFO L273 TraceCheckUtils]: 43: Hoare triple {6687#(<= main_~i~0 12)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6687#(<= main_~i~0 12)} is VALID [2018-11-14 18:54:48,421 INFO L273 TraceCheckUtils]: 44: Hoare triple {6687#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6688#(<= main_~i~0 13)} is VALID [2018-11-14 18:54:48,422 INFO L273 TraceCheckUtils]: 45: Hoare triple {6688#(<= main_~i~0 13)} assume true; {6688#(<= main_~i~0 13)} is VALID [2018-11-14 18:54:48,422 INFO L273 TraceCheckUtils]: 46: Hoare triple {6688#(<= main_~i~0 13)} assume !(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,423 INFO L273 TraceCheckUtils]: 47: Hoare triple {6674#false} ~i~0 := 0; {6674#false} is VALID [2018-11-14 18:54:48,423 INFO L273 TraceCheckUtils]: 48: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,423 INFO L273 TraceCheckUtils]: 49: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,423 INFO L273 TraceCheckUtils]: 50: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,424 INFO L273 TraceCheckUtils]: 51: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,424 INFO L273 TraceCheckUtils]: 52: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,424 INFO L273 TraceCheckUtils]: 53: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,424 INFO L273 TraceCheckUtils]: 54: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,424 INFO L273 TraceCheckUtils]: 55: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,425 INFO L273 TraceCheckUtils]: 56: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,425 INFO L273 TraceCheckUtils]: 57: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,425 INFO L273 TraceCheckUtils]: 58: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,425 INFO L273 TraceCheckUtils]: 59: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,425 INFO L273 TraceCheckUtils]: 60: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,426 INFO L273 TraceCheckUtils]: 61: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,426 INFO L273 TraceCheckUtils]: 62: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,426 INFO L273 TraceCheckUtils]: 63: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,426 INFO L273 TraceCheckUtils]: 64: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,426 INFO L273 TraceCheckUtils]: 65: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,426 INFO L273 TraceCheckUtils]: 66: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,426 INFO L273 TraceCheckUtils]: 67: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,427 INFO L273 TraceCheckUtils]: 68: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,427 INFO L273 TraceCheckUtils]: 69: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,427 INFO L273 TraceCheckUtils]: 70: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,427 INFO L273 TraceCheckUtils]: 71: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,427 INFO L273 TraceCheckUtils]: 72: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,427 INFO L273 TraceCheckUtils]: 73: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,427 INFO L273 TraceCheckUtils]: 74: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,427 INFO L273 TraceCheckUtils]: 75: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,428 INFO L273 TraceCheckUtils]: 76: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,428 INFO L273 TraceCheckUtils]: 77: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,428 INFO L273 TraceCheckUtils]: 78: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,428 INFO L273 TraceCheckUtils]: 79: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,428 INFO L273 TraceCheckUtils]: 80: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,428 INFO L273 TraceCheckUtils]: 81: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,428 INFO L273 TraceCheckUtils]: 82: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,428 INFO L273 TraceCheckUtils]: 83: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,429 INFO L273 TraceCheckUtils]: 84: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,429 INFO L273 TraceCheckUtils]: 85: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,429 INFO L273 TraceCheckUtils]: 86: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,429 INFO L273 TraceCheckUtils]: 87: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,429 INFO L273 TraceCheckUtils]: 88: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,429 INFO L273 TraceCheckUtils]: 89: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,429 INFO L273 TraceCheckUtils]: 90: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,429 INFO L273 TraceCheckUtils]: 91: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,430 INFO L273 TraceCheckUtils]: 92: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,430 INFO L273 TraceCheckUtils]: 93: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,430 INFO L273 TraceCheckUtils]: 94: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,430 INFO L273 TraceCheckUtils]: 95: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,430 INFO L273 TraceCheckUtils]: 96: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,430 INFO L273 TraceCheckUtils]: 97: Hoare triple {6674#false} assume !!(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,430 INFO L273 TraceCheckUtils]: 98: Hoare triple {6674#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6674#false} is VALID [2018-11-14 18:54:48,430 INFO L273 TraceCheckUtils]: 99: Hoare triple {6674#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6674#false} is VALID [2018-11-14 18:54:48,431 INFO L273 TraceCheckUtils]: 100: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,431 INFO L273 TraceCheckUtils]: 101: Hoare triple {6674#false} assume !(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,431 INFO L273 TraceCheckUtils]: 102: Hoare triple {6674#false} havoc ~x~0;~x~0 := 0; {6674#false} is VALID [2018-11-14 18:54:48,431 INFO L273 TraceCheckUtils]: 103: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:54:48,431 INFO L273 TraceCheckUtils]: 104: Hoare triple {6674#false} assume !!(~x~0 < 200000); {6674#false} is VALID [2018-11-14 18:54:48,431 INFO L273 TraceCheckUtils]: 105: Hoare triple {6674#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {6674#false} is VALID [2018-11-14 18:54:48,431 INFO L256 TraceCheckUtils]: 106: Hoare triple {6674#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6674#false} is VALID [2018-11-14 18:54:48,431 INFO L273 TraceCheckUtils]: 107: Hoare triple {6674#false} ~cond := #in~cond; {6674#false} is VALID [2018-11-14 18:54:48,432 INFO L273 TraceCheckUtils]: 108: Hoare triple {6674#false} assume ~cond == 0; {6674#false} is VALID [2018-11-14 18:54:48,432 INFO L273 TraceCheckUtils]: 109: Hoare triple {6674#false} assume !false; {6674#false} is VALID [2018-11-14 18:54:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-11-14 18:54:48,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:48,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:54:48,446 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:55:49,133 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-11-14 18:55:49,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:55:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:49,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:55:49,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {6673#true} call ULTIMATE.init(); {6673#true} is VALID [2018-11-14 18:55:49,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {6673#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6673#true} is VALID [2018-11-14 18:55:49,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6673#true} {6673#true} #76#return; {6673#true} is VALID [2018-11-14 18:55:49,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {6673#true} call #t~ret8 := main(); {6673#true} is VALID [2018-11-14 18:55:49,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {6673#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {6673#true} is VALID [2018-11-14 18:55:49,365 INFO L273 TraceCheckUtils]: 6: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,366 INFO L273 TraceCheckUtils]: 9: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,367 INFO L273 TraceCheckUtils]: 15: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,367 INFO L273 TraceCheckUtils]: 16: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,367 INFO L273 TraceCheckUtils]: 17: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,367 INFO L273 TraceCheckUtils]: 18: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,367 INFO L273 TraceCheckUtils]: 19: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,368 INFO L273 TraceCheckUtils]: 20: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,368 INFO L273 TraceCheckUtils]: 21: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,368 INFO L273 TraceCheckUtils]: 22: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,368 INFO L273 TraceCheckUtils]: 23: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,368 INFO L273 TraceCheckUtils]: 24: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,368 INFO L273 TraceCheckUtils]: 25: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,369 INFO L273 TraceCheckUtils]: 26: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,369 INFO L273 TraceCheckUtils]: 27: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,369 INFO L273 TraceCheckUtils]: 30: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,369 INFO L273 TraceCheckUtils]: 31: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,370 INFO L273 TraceCheckUtils]: 33: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,370 INFO L273 TraceCheckUtils]: 34: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,370 INFO L273 TraceCheckUtils]: 35: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,370 INFO L273 TraceCheckUtils]: 36: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,370 INFO L273 TraceCheckUtils]: 37: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,371 INFO L273 TraceCheckUtils]: 38: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,371 INFO L273 TraceCheckUtils]: 39: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,371 INFO L273 TraceCheckUtils]: 40: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,371 INFO L273 TraceCheckUtils]: 41: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,371 INFO L273 TraceCheckUtils]: 42: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,371 INFO L273 TraceCheckUtils]: 43: Hoare triple {6673#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {6673#true} is VALID [2018-11-14 18:55:49,372 INFO L273 TraceCheckUtils]: 44: Hoare triple {6673#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6673#true} is VALID [2018-11-14 18:55:49,372 INFO L273 TraceCheckUtils]: 45: Hoare triple {6673#true} assume true; {6673#true} is VALID [2018-11-14 18:55:49,372 INFO L273 TraceCheckUtils]: 46: Hoare triple {6673#true} assume !(~i~0 < 200000); {6673#true} is VALID [2018-11-14 18:55:49,386 INFO L273 TraceCheckUtils]: 47: Hoare triple {6673#true} ~i~0 := 0; {6833#(<= main_~i~0 0)} is VALID [2018-11-14 18:55:49,386 INFO L273 TraceCheckUtils]: 48: Hoare triple {6833#(<= main_~i~0 0)} assume true; {6833#(<= main_~i~0 0)} is VALID [2018-11-14 18:55:49,388 INFO L273 TraceCheckUtils]: 49: Hoare triple {6833#(<= main_~i~0 0)} assume !!(~i~0 < 200000); {6833#(<= main_~i~0 0)} is VALID [2018-11-14 18:55:49,388 INFO L273 TraceCheckUtils]: 50: Hoare triple {6833#(<= main_~i~0 0)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6833#(<= main_~i~0 0)} is VALID [2018-11-14 18:55:49,389 INFO L273 TraceCheckUtils]: 51: Hoare triple {6833#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6676#(<= main_~i~0 1)} is VALID [2018-11-14 18:55:49,390 INFO L273 TraceCheckUtils]: 52: Hoare triple {6676#(<= main_~i~0 1)} assume true; {6676#(<= main_~i~0 1)} is VALID [2018-11-14 18:55:49,390 INFO L273 TraceCheckUtils]: 53: Hoare triple {6676#(<= main_~i~0 1)} assume !!(~i~0 < 200000); {6676#(<= main_~i~0 1)} is VALID [2018-11-14 18:55:49,392 INFO L273 TraceCheckUtils]: 54: Hoare triple {6676#(<= main_~i~0 1)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6676#(<= main_~i~0 1)} is VALID [2018-11-14 18:55:49,393 INFO L273 TraceCheckUtils]: 55: Hoare triple {6676#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6677#(<= main_~i~0 2)} is VALID [2018-11-14 18:55:49,393 INFO L273 TraceCheckUtils]: 56: Hoare triple {6677#(<= main_~i~0 2)} assume true; {6677#(<= main_~i~0 2)} is VALID [2018-11-14 18:55:49,393 INFO L273 TraceCheckUtils]: 57: Hoare triple {6677#(<= main_~i~0 2)} assume !!(~i~0 < 200000); {6677#(<= main_~i~0 2)} is VALID [2018-11-14 18:55:49,394 INFO L273 TraceCheckUtils]: 58: Hoare triple {6677#(<= main_~i~0 2)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6677#(<= main_~i~0 2)} is VALID [2018-11-14 18:55:49,394 INFO L273 TraceCheckUtils]: 59: Hoare triple {6677#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6678#(<= main_~i~0 3)} is VALID [2018-11-14 18:55:49,395 INFO L273 TraceCheckUtils]: 60: Hoare triple {6678#(<= main_~i~0 3)} assume true; {6678#(<= main_~i~0 3)} is VALID [2018-11-14 18:55:49,395 INFO L273 TraceCheckUtils]: 61: Hoare triple {6678#(<= main_~i~0 3)} assume !!(~i~0 < 200000); {6678#(<= main_~i~0 3)} is VALID [2018-11-14 18:55:49,395 INFO L273 TraceCheckUtils]: 62: Hoare triple {6678#(<= main_~i~0 3)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6678#(<= main_~i~0 3)} is VALID [2018-11-14 18:55:49,396 INFO L273 TraceCheckUtils]: 63: Hoare triple {6678#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6679#(<= main_~i~0 4)} is VALID [2018-11-14 18:55:49,397 INFO L273 TraceCheckUtils]: 64: Hoare triple {6679#(<= main_~i~0 4)} assume true; {6679#(<= main_~i~0 4)} is VALID [2018-11-14 18:55:49,397 INFO L273 TraceCheckUtils]: 65: Hoare triple {6679#(<= main_~i~0 4)} assume !!(~i~0 < 200000); {6679#(<= main_~i~0 4)} is VALID [2018-11-14 18:55:49,398 INFO L273 TraceCheckUtils]: 66: Hoare triple {6679#(<= main_~i~0 4)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6679#(<= main_~i~0 4)} is VALID [2018-11-14 18:55:49,398 INFO L273 TraceCheckUtils]: 67: Hoare triple {6679#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6680#(<= main_~i~0 5)} is VALID [2018-11-14 18:55:49,399 INFO L273 TraceCheckUtils]: 68: Hoare triple {6680#(<= main_~i~0 5)} assume true; {6680#(<= main_~i~0 5)} is VALID [2018-11-14 18:55:49,400 INFO L273 TraceCheckUtils]: 69: Hoare triple {6680#(<= main_~i~0 5)} assume !!(~i~0 < 200000); {6680#(<= main_~i~0 5)} is VALID [2018-11-14 18:55:49,400 INFO L273 TraceCheckUtils]: 70: Hoare triple {6680#(<= main_~i~0 5)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6680#(<= main_~i~0 5)} is VALID [2018-11-14 18:55:49,401 INFO L273 TraceCheckUtils]: 71: Hoare triple {6680#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6681#(<= main_~i~0 6)} is VALID [2018-11-14 18:55:49,401 INFO L273 TraceCheckUtils]: 72: Hoare triple {6681#(<= main_~i~0 6)} assume true; {6681#(<= main_~i~0 6)} is VALID [2018-11-14 18:55:49,402 INFO L273 TraceCheckUtils]: 73: Hoare triple {6681#(<= main_~i~0 6)} assume !!(~i~0 < 200000); {6681#(<= main_~i~0 6)} is VALID [2018-11-14 18:55:49,402 INFO L273 TraceCheckUtils]: 74: Hoare triple {6681#(<= main_~i~0 6)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6681#(<= main_~i~0 6)} is VALID [2018-11-14 18:55:49,403 INFO L273 TraceCheckUtils]: 75: Hoare triple {6681#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6682#(<= main_~i~0 7)} is VALID [2018-11-14 18:55:49,404 INFO L273 TraceCheckUtils]: 76: Hoare triple {6682#(<= main_~i~0 7)} assume true; {6682#(<= main_~i~0 7)} is VALID [2018-11-14 18:55:49,404 INFO L273 TraceCheckUtils]: 77: Hoare triple {6682#(<= main_~i~0 7)} assume !!(~i~0 < 200000); {6682#(<= main_~i~0 7)} is VALID [2018-11-14 18:55:49,405 INFO L273 TraceCheckUtils]: 78: Hoare triple {6682#(<= main_~i~0 7)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6682#(<= main_~i~0 7)} is VALID [2018-11-14 18:55:49,406 INFO L273 TraceCheckUtils]: 79: Hoare triple {6682#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6683#(<= main_~i~0 8)} is VALID [2018-11-14 18:55:49,406 INFO L273 TraceCheckUtils]: 80: Hoare triple {6683#(<= main_~i~0 8)} assume true; {6683#(<= main_~i~0 8)} is VALID [2018-11-14 18:55:49,407 INFO L273 TraceCheckUtils]: 81: Hoare triple {6683#(<= main_~i~0 8)} assume !!(~i~0 < 200000); {6683#(<= main_~i~0 8)} is VALID [2018-11-14 18:55:49,407 INFO L273 TraceCheckUtils]: 82: Hoare triple {6683#(<= main_~i~0 8)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6683#(<= main_~i~0 8)} is VALID [2018-11-14 18:55:49,408 INFO L273 TraceCheckUtils]: 83: Hoare triple {6683#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6684#(<= main_~i~0 9)} is VALID [2018-11-14 18:55:49,409 INFO L273 TraceCheckUtils]: 84: Hoare triple {6684#(<= main_~i~0 9)} assume true; {6684#(<= main_~i~0 9)} is VALID [2018-11-14 18:55:49,409 INFO L273 TraceCheckUtils]: 85: Hoare triple {6684#(<= main_~i~0 9)} assume !!(~i~0 < 200000); {6684#(<= main_~i~0 9)} is VALID [2018-11-14 18:55:49,410 INFO L273 TraceCheckUtils]: 86: Hoare triple {6684#(<= main_~i~0 9)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6684#(<= main_~i~0 9)} is VALID [2018-11-14 18:55:49,411 INFO L273 TraceCheckUtils]: 87: Hoare triple {6684#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6685#(<= main_~i~0 10)} is VALID [2018-11-14 18:55:49,411 INFO L273 TraceCheckUtils]: 88: Hoare triple {6685#(<= main_~i~0 10)} assume true; {6685#(<= main_~i~0 10)} is VALID [2018-11-14 18:55:49,412 INFO L273 TraceCheckUtils]: 89: Hoare triple {6685#(<= main_~i~0 10)} assume !!(~i~0 < 200000); {6685#(<= main_~i~0 10)} is VALID [2018-11-14 18:55:49,412 INFO L273 TraceCheckUtils]: 90: Hoare triple {6685#(<= main_~i~0 10)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6685#(<= main_~i~0 10)} is VALID [2018-11-14 18:55:49,413 INFO L273 TraceCheckUtils]: 91: Hoare triple {6685#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6686#(<= main_~i~0 11)} is VALID [2018-11-14 18:55:49,414 INFO L273 TraceCheckUtils]: 92: Hoare triple {6686#(<= main_~i~0 11)} assume true; {6686#(<= main_~i~0 11)} is VALID [2018-11-14 18:55:49,414 INFO L273 TraceCheckUtils]: 93: Hoare triple {6686#(<= main_~i~0 11)} assume !!(~i~0 < 200000); {6686#(<= main_~i~0 11)} is VALID [2018-11-14 18:55:49,415 INFO L273 TraceCheckUtils]: 94: Hoare triple {6686#(<= main_~i~0 11)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6686#(<= main_~i~0 11)} is VALID [2018-11-14 18:55:49,415 INFO L273 TraceCheckUtils]: 95: Hoare triple {6686#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6687#(<= main_~i~0 12)} is VALID [2018-11-14 18:55:49,416 INFO L273 TraceCheckUtils]: 96: Hoare triple {6687#(<= main_~i~0 12)} assume true; {6687#(<= main_~i~0 12)} is VALID [2018-11-14 18:55:49,417 INFO L273 TraceCheckUtils]: 97: Hoare triple {6687#(<= main_~i~0 12)} assume !!(~i~0 < 200000); {6687#(<= main_~i~0 12)} is VALID [2018-11-14 18:55:49,417 INFO L273 TraceCheckUtils]: 98: Hoare triple {6687#(<= main_~i~0 12)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6687#(<= main_~i~0 12)} is VALID [2018-11-14 18:55:49,418 INFO L273 TraceCheckUtils]: 99: Hoare triple {6687#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6688#(<= main_~i~0 13)} is VALID [2018-11-14 18:55:49,418 INFO L273 TraceCheckUtils]: 100: Hoare triple {6688#(<= main_~i~0 13)} assume true; {6688#(<= main_~i~0 13)} is VALID [2018-11-14 18:55:49,419 INFO L273 TraceCheckUtils]: 101: Hoare triple {6688#(<= main_~i~0 13)} assume !(~i~0 < 200000); {6674#false} is VALID [2018-11-14 18:55:49,419 INFO L273 TraceCheckUtils]: 102: Hoare triple {6674#false} havoc ~x~0;~x~0 := 0; {6674#false} is VALID [2018-11-14 18:55:49,420 INFO L273 TraceCheckUtils]: 103: Hoare triple {6674#false} assume true; {6674#false} is VALID [2018-11-14 18:55:49,420 INFO L273 TraceCheckUtils]: 104: Hoare triple {6674#false} assume !!(~x~0 < 200000); {6674#false} is VALID [2018-11-14 18:55:49,420 INFO L273 TraceCheckUtils]: 105: Hoare triple {6674#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {6674#false} is VALID [2018-11-14 18:55:49,420 INFO L256 TraceCheckUtils]: 106: Hoare triple {6674#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6674#false} is VALID [2018-11-14 18:55:49,420 INFO L273 TraceCheckUtils]: 107: Hoare triple {6674#false} ~cond := #in~cond; {6674#false} is VALID [2018-11-14 18:55:49,421 INFO L273 TraceCheckUtils]: 108: Hoare triple {6674#false} assume ~cond == 0; {6674#false} is VALID [2018-11-14 18:55:49,421 INFO L273 TraceCheckUtils]: 109: Hoare triple {6674#false} assume !false; {6674#false} is VALID [2018-11-14 18:55:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-14 18:55:49,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:55:49,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 18:55:49,459 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-11-14 18:55:49,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:55:49,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:55:49,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:49,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:55:49,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:55:49,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:55:49,599 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 17 states. [2018-11-14 18:55:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:49,934 INFO L93 Difference]: Finished difference Result 193 states and 228 transitions. [2018-11-14 18:55:49,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:55:49,935 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-11-14 18:55:49,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:55:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:55:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 166 transitions. [2018-11-14 18:55:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:55:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 166 transitions. [2018-11-14 18:55:49,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 166 transitions. [2018-11-14 18:55:50,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:55:50,670 INFO L225 Difference]: With dead ends: 193 [2018-11-14 18:55:50,670 INFO L226 Difference]: Without dead ends: 125 [2018-11-14 18:55:50,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:55:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-14 18:55:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-11-14 18:55:50,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:55:50,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 122 states. [2018-11-14 18:55:50,711 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 122 states. [2018-11-14 18:55:50,711 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 122 states. [2018-11-14 18:55:50,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:50,715 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-11-14 18:55:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2018-11-14 18:55:50,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:50,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:50,716 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 125 states. [2018-11-14 18:55:50,716 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 125 states. [2018-11-14 18:55:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:55:50,719 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-11-14 18:55:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2018-11-14 18:55:50,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:55:50,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:55:50,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:55:50,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:55:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 18:55:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2018-11-14 18:55:50,723 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 110 [2018-11-14 18:55:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:55:50,723 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2018-11-14 18:55:50,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:55:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2018-11-14 18:55:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-14 18:55:50,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:55:50,724 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:55:50,725 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:55:50,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:55:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash 365519571, now seen corresponding path program 12 times [2018-11-14 18:55:50,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:55:50,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:55:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:50,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:55:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:55:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:55:51,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {7675#true} call ULTIMATE.init(); {7675#true} is VALID [2018-11-14 18:55:51,481 INFO L273 TraceCheckUtils]: 1: Hoare triple {7675#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7675#true} is VALID [2018-11-14 18:55:51,482 INFO L273 TraceCheckUtils]: 2: Hoare triple {7675#true} assume true; {7675#true} is VALID [2018-11-14 18:55:51,482 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7675#true} {7675#true} #76#return; {7675#true} is VALID [2018-11-14 18:55:51,482 INFO L256 TraceCheckUtils]: 4: Hoare triple {7675#true} call #t~ret8 := main(); {7675#true} is VALID [2018-11-14 18:55:51,483 INFO L273 TraceCheckUtils]: 5: Hoare triple {7675#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {7677#(= main_~i~0 0)} is VALID [2018-11-14 18:55:51,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {7677#(= main_~i~0 0)} assume true; {7677#(= main_~i~0 0)} is VALID [2018-11-14 18:55:51,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {7677#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7677#(= main_~i~0 0)} is VALID [2018-11-14 18:55:51,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {7677#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7678#(<= main_~i~0 1)} is VALID [2018-11-14 18:55:51,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {7678#(<= main_~i~0 1)} assume true; {7678#(<= main_~i~0 1)} is VALID [2018-11-14 18:55:51,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {7678#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7678#(<= main_~i~0 1)} is VALID [2018-11-14 18:55:51,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {7678#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7679#(<= main_~i~0 2)} is VALID [2018-11-14 18:55:51,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {7679#(<= main_~i~0 2)} assume true; {7679#(<= main_~i~0 2)} is VALID [2018-11-14 18:55:51,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {7679#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7679#(<= main_~i~0 2)} is VALID [2018-11-14 18:55:51,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {7679#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7680#(<= main_~i~0 3)} is VALID [2018-11-14 18:55:51,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {7680#(<= main_~i~0 3)} assume true; {7680#(<= main_~i~0 3)} is VALID [2018-11-14 18:55:51,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {7680#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7680#(<= main_~i~0 3)} is VALID [2018-11-14 18:55:51,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {7680#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7681#(<= main_~i~0 4)} is VALID [2018-11-14 18:55:51,489 INFO L273 TraceCheckUtils]: 18: Hoare triple {7681#(<= main_~i~0 4)} assume true; {7681#(<= main_~i~0 4)} is VALID [2018-11-14 18:55:51,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {7681#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7681#(<= main_~i~0 4)} is VALID [2018-11-14 18:55:51,491 INFO L273 TraceCheckUtils]: 20: Hoare triple {7681#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7682#(<= main_~i~0 5)} is VALID [2018-11-14 18:55:51,491 INFO L273 TraceCheckUtils]: 21: Hoare triple {7682#(<= main_~i~0 5)} assume true; {7682#(<= main_~i~0 5)} is VALID [2018-11-14 18:55:51,492 INFO L273 TraceCheckUtils]: 22: Hoare triple {7682#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7682#(<= main_~i~0 5)} is VALID [2018-11-14 18:55:51,493 INFO L273 TraceCheckUtils]: 23: Hoare triple {7682#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7683#(<= main_~i~0 6)} is VALID [2018-11-14 18:55:51,493 INFO L273 TraceCheckUtils]: 24: Hoare triple {7683#(<= main_~i~0 6)} assume true; {7683#(<= main_~i~0 6)} is VALID [2018-11-14 18:55:51,494 INFO L273 TraceCheckUtils]: 25: Hoare triple {7683#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7683#(<= main_~i~0 6)} is VALID [2018-11-14 18:55:51,495 INFO L273 TraceCheckUtils]: 26: Hoare triple {7683#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7684#(<= main_~i~0 7)} is VALID [2018-11-14 18:55:51,496 INFO L273 TraceCheckUtils]: 27: Hoare triple {7684#(<= main_~i~0 7)} assume true; {7684#(<= main_~i~0 7)} is VALID [2018-11-14 18:55:51,496 INFO L273 TraceCheckUtils]: 28: Hoare triple {7684#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7684#(<= main_~i~0 7)} is VALID [2018-11-14 18:55:51,497 INFO L273 TraceCheckUtils]: 29: Hoare triple {7684#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7685#(<= main_~i~0 8)} is VALID [2018-11-14 18:55:51,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {7685#(<= main_~i~0 8)} assume true; {7685#(<= main_~i~0 8)} is VALID [2018-11-14 18:55:51,515 INFO L273 TraceCheckUtils]: 31: Hoare triple {7685#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7685#(<= main_~i~0 8)} is VALID [2018-11-14 18:55:51,528 INFO L273 TraceCheckUtils]: 32: Hoare triple {7685#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7686#(<= main_~i~0 9)} is VALID [2018-11-14 18:55:51,541 INFO L273 TraceCheckUtils]: 33: Hoare triple {7686#(<= main_~i~0 9)} assume true; {7686#(<= main_~i~0 9)} is VALID [2018-11-14 18:55:51,550 INFO L273 TraceCheckUtils]: 34: Hoare triple {7686#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7686#(<= main_~i~0 9)} is VALID [2018-11-14 18:55:51,552 INFO L273 TraceCheckUtils]: 35: Hoare triple {7686#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7687#(<= main_~i~0 10)} is VALID [2018-11-14 18:55:51,553 INFO L273 TraceCheckUtils]: 36: Hoare triple {7687#(<= main_~i~0 10)} assume true; {7687#(<= main_~i~0 10)} is VALID [2018-11-14 18:55:51,553 INFO L273 TraceCheckUtils]: 37: Hoare triple {7687#(<= main_~i~0 10)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7687#(<= main_~i~0 10)} is VALID [2018-11-14 18:55:51,554 INFO L273 TraceCheckUtils]: 38: Hoare triple {7687#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7688#(<= main_~i~0 11)} is VALID [2018-11-14 18:55:51,554 INFO L273 TraceCheckUtils]: 39: Hoare triple {7688#(<= main_~i~0 11)} assume true; {7688#(<= main_~i~0 11)} is VALID [2018-11-14 18:55:51,555 INFO L273 TraceCheckUtils]: 40: Hoare triple {7688#(<= main_~i~0 11)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7688#(<= main_~i~0 11)} is VALID [2018-11-14 18:55:51,555 INFO L273 TraceCheckUtils]: 41: Hoare triple {7688#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7689#(<= main_~i~0 12)} is VALID [2018-11-14 18:55:51,556 INFO L273 TraceCheckUtils]: 42: Hoare triple {7689#(<= main_~i~0 12)} assume true; {7689#(<= main_~i~0 12)} is VALID [2018-11-14 18:55:51,556 INFO L273 TraceCheckUtils]: 43: Hoare triple {7689#(<= main_~i~0 12)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7689#(<= main_~i~0 12)} is VALID [2018-11-14 18:55:51,557 INFO L273 TraceCheckUtils]: 44: Hoare triple {7689#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7690#(<= main_~i~0 13)} is VALID [2018-11-14 18:55:51,558 INFO L273 TraceCheckUtils]: 45: Hoare triple {7690#(<= main_~i~0 13)} assume true; {7690#(<= main_~i~0 13)} is VALID [2018-11-14 18:55:51,559 INFO L273 TraceCheckUtils]: 46: Hoare triple {7690#(<= main_~i~0 13)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2; {7690#(<= main_~i~0 13)} is VALID [2018-11-14 18:55:51,559 INFO L273 TraceCheckUtils]: 47: Hoare triple {7690#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7691#(<= main_~i~0 14)} is VALID [2018-11-14 18:55:51,560 INFO L273 TraceCheckUtils]: 48: Hoare triple {7691#(<= main_~i~0 14)} assume true; {7691#(<= main_~i~0 14)} is VALID [2018-11-14 18:55:51,561 INFO L273 TraceCheckUtils]: 49: Hoare triple {7691#(<= main_~i~0 14)} assume !(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,561 INFO L273 TraceCheckUtils]: 50: Hoare triple {7676#false} ~i~0 := 0; {7676#false} is VALID [2018-11-14 18:55:51,561 INFO L273 TraceCheckUtils]: 51: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,562 INFO L273 TraceCheckUtils]: 52: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,562 INFO L273 TraceCheckUtils]: 53: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,562 INFO L273 TraceCheckUtils]: 54: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,562 INFO L273 TraceCheckUtils]: 55: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,563 INFO L273 TraceCheckUtils]: 56: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,563 INFO L273 TraceCheckUtils]: 57: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,563 INFO L273 TraceCheckUtils]: 58: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,563 INFO L273 TraceCheckUtils]: 59: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,564 INFO L273 TraceCheckUtils]: 60: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,564 INFO L273 TraceCheckUtils]: 61: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,564 INFO L273 TraceCheckUtils]: 62: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,564 INFO L273 TraceCheckUtils]: 63: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,564 INFO L273 TraceCheckUtils]: 64: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,564 INFO L273 TraceCheckUtils]: 65: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,564 INFO L273 TraceCheckUtils]: 66: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,565 INFO L273 TraceCheckUtils]: 67: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,565 INFO L273 TraceCheckUtils]: 68: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,565 INFO L273 TraceCheckUtils]: 69: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,565 INFO L273 TraceCheckUtils]: 70: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,565 INFO L273 TraceCheckUtils]: 71: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,565 INFO L273 TraceCheckUtils]: 72: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,565 INFO L273 TraceCheckUtils]: 73: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,566 INFO L273 TraceCheckUtils]: 74: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,566 INFO L273 TraceCheckUtils]: 75: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,566 INFO L273 TraceCheckUtils]: 76: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,566 INFO L273 TraceCheckUtils]: 77: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,566 INFO L273 TraceCheckUtils]: 78: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,566 INFO L273 TraceCheckUtils]: 79: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,566 INFO L273 TraceCheckUtils]: 80: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,567 INFO L273 TraceCheckUtils]: 81: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,567 INFO L273 TraceCheckUtils]: 82: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,567 INFO L273 TraceCheckUtils]: 83: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,567 INFO L273 TraceCheckUtils]: 84: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,567 INFO L273 TraceCheckUtils]: 85: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,567 INFO L273 TraceCheckUtils]: 86: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,567 INFO L273 TraceCheckUtils]: 87: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,568 INFO L273 TraceCheckUtils]: 88: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,568 INFO L273 TraceCheckUtils]: 89: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,568 INFO L273 TraceCheckUtils]: 90: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,568 INFO L273 TraceCheckUtils]: 91: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,568 INFO L273 TraceCheckUtils]: 92: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,568 INFO L273 TraceCheckUtils]: 93: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,569 INFO L273 TraceCheckUtils]: 94: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,569 INFO L273 TraceCheckUtils]: 95: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,569 INFO L273 TraceCheckUtils]: 96: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,569 INFO L273 TraceCheckUtils]: 97: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,569 INFO L273 TraceCheckUtils]: 98: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,569 INFO L273 TraceCheckUtils]: 99: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,569 INFO L273 TraceCheckUtils]: 100: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,570 INFO L273 TraceCheckUtils]: 101: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,570 INFO L273 TraceCheckUtils]: 102: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,570 INFO L273 TraceCheckUtils]: 103: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,570 INFO L273 TraceCheckUtils]: 104: Hoare triple {7676#false} assume !!(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,570 INFO L273 TraceCheckUtils]: 105: Hoare triple {7676#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7676#false} is VALID [2018-11-14 18:55:51,570 INFO L273 TraceCheckUtils]: 106: Hoare triple {7676#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7676#false} is VALID [2018-11-14 18:55:51,570 INFO L273 TraceCheckUtils]: 107: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,571 INFO L273 TraceCheckUtils]: 108: Hoare triple {7676#false} assume !(~i~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,571 INFO L273 TraceCheckUtils]: 109: Hoare triple {7676#false} havoc ~x~0;~x~0 := 0; {7676#false} is VALID [2018-11-14 18:55:51,571 INFO L273 TraceCheckUtils]: 110: Hoare triple {7676#false} assume true; {7676#false} is VALID [2018-11-14 18:55:51,571 INFO L273 TraceCheckUtils]: 111: Hoare triple {7676#false} assume !!(~x~0 < 200000); {7676#false} is VALID [2018-11-14 18:55:51,571 INFO L273 TraceCheckUtils]: 112: Hoare triple {7676#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~x~0 * 4, 4); {7676#false} is VALID [2018-11-14 18:55:51,571 INFO L256 TraceCheckUtils]: 113: Hoare triple {7676#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7676#false} is VALID [2018-11-14 18:55:51,571 INFO L273 TraceCheckUtils]: 114: Hoare triple {7676#false} ~cond := #in~cond; {7676#false} is VALID [2018-11-14 18:55:51,572 INFO L273 TraceCheckUtils]: 115: Hoare triple {7676#false} assume ~cond == 0; {7676#false} is VALID [2018-11-14 18:55:51,572 INFO L273 TraceCheckUtils]: 116: Hoare triple {7676#false} assume !false; {7676#false} is VALID [2018-11-14 18:55:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-14 18:55:51,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:55:51,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:55:51,594 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE